Country: Netherlands

Found 18376 papers in total
Facet identification for the symmetric traveling salesman polytope
Facet identification for the symmetric traveling salesman polytope
1990,
Several procedures for the identification of facet inducing inequalities for the...
Some proximity and sensitivity results in quadratic integer programming
Some proximity and sensitivity results in quadratic integer programming
1990,
The authors show that for any optimal solution nz for a given separable quadratic...
On the convergence of cross decomposition
On the convergence of cross decomposition
1990,
Cross decomposition is a recent method for mixed integer programming problems,...
A spectral approach to polyhedral dimension
A spectral approach to polyhedral dimension
1990,
The spectrum spec( 𝒫) of a convex polytope 𝒫⊆ℝ E is defined as the...
A ‘build-down’ scheme for linear programming
A ‘build-down’ scheme for linear programming
1990,
The paper proposes a ‘build-down’ scheme for Karmarkar’s algorithm...
Some properties of the sequential Markovian allocation problem
Some properties of the sequential Markovian allocation problem
1989,
This paper deals with a stochastic allocation problem associated with the Markov...
Karmarkar’s algorithm with improved steps
Karmarkar’s algorithm with improved steps
1990,
The paper defines a function of the interior of the feasible region of...
An exponential example for Terlaky’s pivoting rule for the criss-cross simplex method
An exponential example for Terlaky’s pivoting rule for the criss-cross simplex method
1990,
Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex...
A one-phase algorithm for semi-infinite linear programming
A one-phase algorithm for semi-infinite linear programming
1990,
The paper presents an algorithm for solving a large class of semi-infinite linear...
Asymptotic behaviour of Karmarkar’s method for linear programming
Asymptotic behaviour of Karmarkar’s method for linear programming
1990,
The asymptotic behaviour of Karmarkar’s method is studied and an estimate of the...
On the improvement per iteration in Karmarkar’s algorithm for linear programming
On the improvement per iteration in Karmarkar’s algorithm for linear programming
1990,
We investigate the decrease in potential at an iteration of Karmarkar’s...
A recursive procedure to generate all cuts for 0-1 mixed integer programs
A recursive procedure to generate all cuts for 0-1 mixed integer programs
1990,
The authors study several ways of obtaining valid inequalities for mixed integer...
Linear updates for a single-phase projective method
Linear updates for a single-phase projective method
1990,
De Ghellinck and Vial developed a single-phase polynomial projective method for the...
Engineering applications of discrete time optimal control
Engineering applications of discrete time optimal control
1990,
Many problems of design and operation of engineering systems can be formulated as...
The principal pivoting method revisited
The principal pivoting method revisited
1990,
The principal pivoting method (PPM) for the linear complementarity problem (LCP) is...
CP-rays in simplicial cones
CP-rays in simplicial cones
1990,
This paper is dedicated to the memory of Paolo M. Camerini of Politecnico di Milano...
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
1990,
This paper deals with the LCP (linear complementarity problem) with a positive...
An analysis of the structure of expert knowledge
An analysis of the structure of expert knowledge
1990,
An important criterion affecting the success of an expert system is the quality of the...
Error bounds for nondegenerate monotone linear complementarity problems
Error bounds for nondegenerate monotone linear complementarity problems
1990,
Error bounds and upper Lipschitz continuity results are given for monotone linear...
Rule-based formalism and preference representation: An extension of NEGOPLAN
Rule-based formalism and preference representation: An extension of NEGOPLAN
1990,
NEGOPLAN is a prototype expert system shell for negotiation support and strategic...
Containing and shrinking ellipsoids in the path-following algorithm
Containing and shrinking ellipsoids in the path-following algorithm
1990,
The authors describe a new potential function and a sequence of ellipsoids in the...
A short proof of finiteness of Murty’s principal pivoting algorithm
A short proof of finiteness of Murty’s principal pivoting algorithm
1990,
The paper gives a short proof of the finiteness of Murty’s principal pivoting...
Generalized linear complementarity problems
Generalized linear complementarity problems
1990,
It has been shown by Lemke that if a matrix is copositive plus on ℝ n , then...
An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations
An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations
1990,
The paper presents an algorithm for linear programming which requires arithmetic...
Papers per page: