Journal: Mathematical Programming

Found 797 papers in total
On the solitaire cone and its relationship to multi-commodity flows
On the solitaire cone and its relationship to multi-commodity flows
2001,
The classical game of Peg Solitaire has uncertain origins, but was certainly popular...
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
2001,
In the paper ‘On the nucleolus of the basic vehicle routing game’,...
A .699-approximation algorithm for max-bisection
A .699-approximation algorithm for max-bisection
2001,
We present a .699-approximation algorithm for max-bisection, i.e., partitioning the...
Optimization via enumeration: A new algorithm for the max cut problem
Optimization via enumeration: A new algorithm for the max cut problem
2001,
We present a polynomial time algorithm to find the maximum weight of an edge-cut in...
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
2001,
Consider the problem of routing the electrical connections among two large terminal...
On sensitivity of central solutions in semidefinite programming
On sensitivity of central solutions in semidefinite programming
2001,
In this paper we study the properties of the analytic central path of a semidefinite...
On the complexity of a class of combinatorial optimization problems with uncertainty
On the complexity of a class of combinatorial optimization problems with uncertainty
2001,
We consider a robust (minmax-regret) version of the problem of selecting p elements of...
A cutting plane algorithm for the general routing problem
A cutting plane algorithm for the general routing problem
2001,
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a...
Variational analysis of non-Lipschitz spectral functions
Variational analysis of non-Lipschitz spectral functions
2001,
We consider spectral functions f o λ, where f is any permutation-invariant...
Combinatorial relaxation algorithm for mixed polynomial matrices
Combinatorial relaxation algorithm for mixed polynomial matrices
2001,
The notion of mixed polynomial matrices is a mathematical tool for faithful...
Concavity cuts for disjoint bilinear programming
Concavity cuts for disjoint bilinear programming
2001,
We pursue the study of concavity cuts for the disjoint bilinear programming problem....
A geometric study of duality gaps, with applications
A geometric study of duality gaps, with applications
2001,
Lagrangian relaxation is often an efficient tool to solve (large-scale) optimization...
Convergence and efficiency of subgradient methods for quasiconvex minimization
Convergence and efficiency of subgradient methods for quasiconvex minimization
2001,
We study a general subgradient projection method for minimizing a quasiconvex...
Logarithmic sequential unconstrained minimization technique limits in convex programming
Logarithmic sequential unconstrained minimization technique limits in convex programming
2001,
The limits of a class of primal and dual solution trajectories associated with the...
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
2001,
This note studies -->χ --> A , a condition number used in the linear programming...
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
2001,
In a recent paper, the authors have proved results characterizing convexity-preserving...
Quadratic convergence of potential-reduction methods for degenerate problems
Quadratic convergence of potential-reduction methods for degenerate problems
2001,
Global and local convergence properties of a primal–dual interior-point pure...
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
2001,
We analyze perturbations of the right-hand side and the cost parameters in linear...
Mixing mixed-integer inequalities
Mixing mixed-integer inequalities
2001,
Mixed-integer rounding inequalities play a central role in the development of strong...
On the convergence of the Newton/log-barrier method
On the convergence of the Newton/log-barrier method
2001,
In the Newton/log-barrier method, Newton steps are taken for the log-barrier function...
On reduced convex quadratic programming formulations of monotone linear complementarity problems
On reduced convex quadratic programming formulations of monotone linear complementarity problems
2001,
Techniques for transforming convex quadratic programs (QPs) into monotone linear...
A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
2001,
An algorithm incorporating the logarithmic barrier into the Benders decomposition...
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
2001,
Many optimization problems have several equivalent mathematical models. It is often...
A new bound for the quadratic assignment problem based on convex quadratic programming
A new bound for the quadratic assignment problem based on convex quadratic programming
2001,
We describe a new convex quadratic programming bound for the quadratic assignment...
Papers per page: