Journal: Mathematical Programming (Series A)

Found 506 papers in total
Extended formulations for the A-cut problem
Extended formulations for the A-cut problem
1996,
Let G=(V,E) be an undirected graph and A⊆V. The authors consider the problem of...
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
1996,
Adler and Monteiro developed a parametric analysis approach that is naturally related...
An iteration bound primal-dual cone affine scaling algorithm for linear programming
An iteration bound primal-dual cone affine scaling algorithm for linear programming
1996,
In this paper the authors introduce a primal-dual affine scaling method. The method...
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
1996,
In this paper the authors give a new convergence analysis of a projective scaling...
Scheduling jobs of equal length: Complexity, facets and computational results
Scheduling jobs of equal length: Complexity, facets and computational results
1996,
The following problem was originally motivated by a question arising in the automated...
A cutting plane algorithm for convex programming that uses analytic centers
A cutting plane algorithm for convex programming that uses analytic centers
1995,
An oracle for a convex set accepts as input any point z in , and if , then it returns...
A generalized subgradient method wtih relaxation step
A generalized subgradient method wtih relaxation step
1995,
The paper studies conditions for convergence of a generalized subgradient algorithm in...
A note on locally Lipschitzian functions
A note on locally Lipschitzian functions
1995,
An oversight in a paper of Correa and Lemaréchal is noted; a counterexample is...
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
1995,
Lagrangian relaxation is a powerful bounding technique that has been applied...
Ideal polytopes and face structures of some combinatorial optimization problems
Ideal polytopes and face structures of some combinatorial optimization problems
1995,
Given a finite set X and a family of ‘feasible’ subsets ℱ of X, the...
A closed-form representation of mixed-integer program value functions
A closed-form representation of mixed-integer program value functions
1995,
The paper identifies a class of formulas computable in polynomial time such that the...
New algorithms for linear k-matroid intersection and matroid k-parity problems
New algorithms for linear k-matroid intersection and matroid k-parity problems
1995,
The paper presents algorithms for the k- Matroid Intersection Problem and for the...
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
1995,
A 0,¸±1-matrix A is balanced if, in every submatrix with two nonzero...
Applying Lehman’s theorems to packing problems
Applying Lehman’s theorems to packing problems
1995,
A 0-1 matrix A is ideal if the polyhedron Q(A)= conv{ x∈ Q ’...
Segments in enumerating faces
Segments in enumerating faces
1995,
The authors introduce the concept of a segment of a degenerate convex polytope...
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
1995,
Recently, Mehrotra proposed a predictor-corrector primal-dual interior-point algorithm...
Superlinear primal-dual affine scaling algorithms for LCP
Superlinear primal-dual affine scaling algorithms for LCP
1995,
The authors describe an interior-point algorithm for monotone liner complementarity...
Primal-dual methods for linear programming
Primal-dual methods for linear programming
1995,
Many interior-point methods for linear programming are based on the properties of the...
Linear programming, complexity theory and elementary functional analysis
Linear programming, complexity theory and elementary functional analysis
1995,
The paper proposes analyzing interior-point methods using notions of problem-instance...
Presolving in linear programming
Presolving in linear programming
1995,
Most modern linear programming solvers analyze the LP problem before submitting it to...
On the complexity of solving feasible systems of linear inequalities specified with approximate data
On the complexity of solving feasible systems of linear inequalities specified with approximate data
1995,
An algorithm that gives an approximate solution of a desired accuracy to a system of...
A unifying geometric solution framework and complexity analysis for variational inequalities
A unifying geometric solution framework and complexity analysis for variational inequalities
1995,
In this paper, the authors propose a concept of polynomiality for variational...
An interior-point method for generalized linear-fractional programming
An interior-point method for generalized linear-fractional programming
1995,
The authors develop an interior-point polynomial-time algorithm for a generalized...
A continuation method for monotone variational inequalities
A continuation method for monotone variational inequalities
1995,
This paper presents a continuation method for monotone variational inequality problems...
Papers per page: