Country: Netherlands

Found 18376 papers in total
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996,
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
On the partial order polytope of a digraph
On the partial order polytope of a digraph
1996,
The paper introduces the partial order polytope of a digraph D, defined as the convex...
Constraint logic programming for qualitative and quantitative constraint satisfaction problems
Constraint logic programming for qualitative and quantitative constraint satisfaction problems
1996,
AI and Operational Research OR approaches have complementary strengths: AI in...
Evaluating the information content of a measure of plant output: An application to high-technology manufacturing
Evaluating the information content of a measure of plant output: An application to high-technology manufacturing
1996,
Commonly used measures of plant output have been criticized for their inability to...
A note on deriving weights from pairwise comparison ratio matrices
A note on deriving weights from pairwise comparison ratio matrices
1994,
This paper addresses the Cook and Kress method regarding the use of mathematical...
Speeding up Karmarkar’s algorithm for multicommodity flows
Speeding up Karmarkar’s algorithm for multicommodity flows
1996,
The authors show how to speed up Karmarkar’s linear programming algorithm for...
A parametric approach for maximum flow problems with an additional reverse convex constraint
A parametric approach for maximum flow problems with an additional reverse convex constraint
1997,
This paper considers maximum integral flow problems with an additional reverse convex...
An interactive procedure using domination cones for bicriterion shortest path problems
An interactive procedure using domination cones for bicriterion shortest path problems
1994,
In this paper an interactive procedure is developed for the bicriterion shortest path...
An approximation algorithm for the license and shift class design problem
An approximation algorithm for the license and shift class design problem
1994,
In this paper a generalization of the license and shift class design problem is...
An active constraints Newton algorithm for the spatial price equilibrium problem
An active constraints Newton algorithm for the spatial price equilibrium problem
1994,
The authors consider the general spatial price equilibrium problem. In order to solve...
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
1996,
This paper shows that an analogue of the classical conjugate gradient method converges...
Open shop, satellite communication and a theorem by Egerváry (1931)
Open shop, satellite communication and a theorem by Egerváry (1931)
1996,
The authors consider a combinatorial optimization problem arising, in different forms,...
An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
1996,
In this note, the authors show that if a convex function is non-increasing and has a...
A set partitioning heuristic for the generalized assignment problem
A set partitioning heuristic for the generalized assignment problem
1994,
This paper discusses a heuristic for the generalized assignment problem (GAP). The...
The three-dimensional bottleneck assignment problem with capacity constraints
The three-dimensional bottleneck assignment problem with capacity constraints
1994,
In the three-dimensional bottleneck assignment problem involving workers, jobs and...
DGAP-The dynamnic generalized assignment problem
DGAP-The dynamnic generalized assignment problem
1997,
The Generalized Assignment Problem is a well-known operations research model. Given a...
A primal-dual approch to inexact subgradient methods
A primal-dual approch to inexact subgradient methods
1996,
For optimization problems with computationally demanding objective functions and...
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
1996,
Convex quadratically constrained quadratic problems are considered. It is shown that...
A quasi-second-order proximal bundle algorithm
A quasi-second-order proximal bundle algorithm
1996,
This paper introduces an algorithm for convex minimization which includes quasi-Newton...
A new algorithm for minimizing convex functions over convex sets
A new algorithm for minimizing convex functions over convex sets
1996,
Let S⊆ℝ’n be a convex set for which there is an oracle with the...
On polychotomous search problems
On polychotomous search problems
1994,
The paper gives a unified treatment of those stochastic sequential search problems...
An algorithm for decomposing the parametric space in multiobjective dynamic programming problems
An algorithm for decomposing the parametric space in multiobjective dynamic programming problems
1994,
This paper presents an algorithm for decomposing the parametric space in...
A new algorithm for generalized fractional programs
A new algorithm for generalized fractional programs
1996,
A new dual problem for convex generalized fractional programs with no duality gap is...
On polynomiality of the method of analytic centers for fractional problems
On polynomiality of the method of analytic centers for fractional problems
1996,
The paper establishes polynomial time convergence of the method of analytic centers...
Papers per page: