Journal: Mathematical Programming (Series A)

Found 506 papers in total
Approximation algorithms for scheduling unrelated parallel machines
Approximation algorithms for scheduling unrelated parallel machines
1990,
The authors consider the following scheduling problem. There are m parallel machines...
A projection method for the uncapacitated facility location problem
A projection method for the uncapacitated facility location problem
1990,
Several algorithms already exist for solving the uncapacitated facility location...
On patching algorithms for random asymmetric travelling salesman problems
On patching algorithms for random asymmetric travelling salesman problems
1990,
Let the arc-lengths L ij of a complete digraph on n vertices be independent uniform...
Cutting-plane proofs in polynomial space
Cutting-plane proofs in polynomial space
1990,
Following Chvátal, cutting planes may be viewed as a proof system for...
Chvátal closures for mixed integer programming problems
Chvátal closures for mixed integer programming problems
1990,
Chvátal introduced the idea of viewing cutting planes as a system for proving...
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...
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...
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...
A new theorem of the alternative
A new theorem of the alternative
1990,
Although the theorems of the alternative have been well known for a long time, their...
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
1990,
In his original analysis of the projective algorithm for linear programming, Karmarkar...
Exchange price equilibria and variational inequalities
Exchange price equilibria and variational inequalities
1990,
The aim of this paper is to show the relevance of the concept and the theory of...
Solving the linear matroid parity problem as a sequence of matroid intersection problems
Solving the linear matroid parity problem as a sequence of matroid intersection problems
1990,
In this paper, the authors present an O( r 4 n) algorithm for the linear matroid...
Papers per page: