Journal: Mathematical Programming (Series A)

Found 506 papers in total
A note on packing paths in planar graphs
A note on packing paths in planar graphs
1995,
Seymour proved that the cut criterion is necessary and sufficient for the solvability...
The precedence-constrained asymmetric traveling salesman polytope
The precedence-constrained asymmetric traveling salesman polytope
1995,
Many applications of the traveling salesman problem require the introduction of...
Worst-case comparison of valid inequalities for the TSP
Worst-case comparison of valid inequalities for the TSP
1995,
The paper considers most of the known classes of valid inequalities for the graphical...
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
1995,
The authors study here a problem of scheduling n job types on m parallel machines,...
Dual decomposition of a single-machine scheduling problem
Dual decomposition of a single-machine scheduling problem
1995,
The paper designs a fast ascent direction algorithm for the Lagrangian dual problem of...
The fleet assignment problem: Solving a large-scale integer program
The fleet assignment problem: Solving a large-scale integer program
1995,
Given a flight schedule and set of aircraft, the fleet assignment problem is to...
Lower bounds for the quadratic assignment problem via triangle decompositions
Lower bounds for the quadratic assignment problem via triangle decompositions
1995,
The authors consider transformations of the (metric) Quadratic Assignment Problem...
An efficient cost scaling algorithm for the assignment problem
An efficient cost scaling algorithm for the assignment problem
1995,
The cost scaling push-relabel method has been shown to be efficient for solving...
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
1995,
Recently a number of papers were written that present low-complexity interior-point...
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
1995,
The paper studies proximal level methods for convex optimization that use projections...
New variants of bundle methods
New variants of bundle methods
1995,
In this paper the authors describe a number of new variants of bundle methods for...
Complexity estimates of some cutting plane methods based on the analytic barrier
Complexity estimates of some cutting plane methods based on the analytic barrier
1995,
This paper establishes the efficiency estimates for two cutting plane methods based on...
A primal-dual potential reduction method for problems involving matrix inequalities
A primal-dual potential reduction method for problems involving matrix inequalities
1995,
The authors describe a potential reduction method for convex optimization problems...
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
1995,
A dual method is presented to solve a linearly constrained optimization problem with...
Unification of basic and composite nondifferentiable optimization
Unification of basic and composite nondifferentiable optimization
1995,
There are two main classes of iterative methods in nondifferentiable optimization...
A descent method with linear programming subproblems for nondifferentiable convex optimization
A descent method with linear programming subproblems for nondifferentiable convex optimization
1995,
Most of the descent methods developed so far suffer from the computational burden due...
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
1995,
In this paper, an entropy-like proximal method for the minimization of a convex...
A Gauss-Newton method for convex composite optimization
A Gauss-Newton method for convex composite optimization
1995,
An extension of the Gauss-Newton method for nonlinear equations to convex composite...
A family of variable metric proximal methods
A family of variable metric proximal methods
1995,
The authors consider conceptual optimization methods combining two ideas: the...
Stochastic on-line knapsack problems
Stochastic on-line knapsack problems
1995,
Different classes of on-line algorithms are developed and analyzed for the solution of...
Computational experience with a difficult mixed-integer multicommodity flow problem
Computational experience with a difficult mixed-integer multicommodity flow problem
1995,
The following problem arises in the study of lightwave networks. Given a demand matrix...
On the choice of parameters for power-series interior point algorithms in linear programming
On the choice of parameters for power-series interior point algorithms in linear programming
1995,
In this paper the authors study higher-order interior point algorithms, especially...
On the convergence of the interation sequence in primal-dual interior-point methods
On the convergence of the interation sequence in primal-dual interior-point methods
1995,
Recently, numerous research efforts, most of them concerned with superlinear...
Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
1995,
While variants of the steepest edge pivot rule are commonly used in linear programming...
Papers per page: