Journal: Mathematical Programming

Found 797 papers in total
Local search algorithms for the rectangle packing problem with general spatial costs
Local search algorithms for the rectangle packing problem with general spatial costs
2003,
We propose local search algorithms for the rectangle packing problem to minimize a...
Stronger linear programming relaxations of max-cut
Stronger linear programming relaxations of max-cut
2003,
We consider linear programming relaxations for the max cut problem in graphs, based on...
Primal–dual algorithms and infinite-dimensional Jordan algebras of finite rank
Primal–dual algorithms and infinite-dimensional Jordan algebras of finite rank
2003,
We consider primal–dual algorithms for certain types of infinite-dimensional...
Robust convex quadratically constrained programs
Robust convex quadratically constrained programs
2003,
In this paper we study robust convex quadratically constrained programs, a subset of...
Minimal concave cost rebalance of a portfolio to the efficient frontier
Minimal concave cost rebalance of a portfolio to the efficient frontier
2003,
One usually constructs a portfolio on the efficient frontier, but it may not be...
A subproblem-centric model and approach to the nurse scheduling problem
A subproblem-centric model and approach to the nurse scheduling problem
2004,
The number of hospitals in Japan exceeds 10,000, and every month nurses are scheduled...
Asymptotic scheduling
Asymptotic scheduling
2003,
We deal with the following scheduling problem: a finite set of jobs is given and each...
The domino inequalities: facets for the symmetric travelling salesman polytope
The domino inequalities: facets for the symmetric travelling salesman polytope
2003,
Adam Letchford has defined the Domino Parity inequalities for the Symmetric Traveling...
Lift-and-project cuts and perfect graphs
Lift-and-project cuts and perfect graphs
2003,
We analyze the application of lift-and-project to the clique relaxation of the stable...
Extending the Balas–Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Extending the Balas–Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
2003,
A result of Balas and Yu states that the number of maximal independent sets of a graph...
The clustering matroid and the optimal clustering tree
The clustering matroid and the optimal clustering tree
2003,
We consider the following problem: Given a complete graph G = ( V, E ) with a...
Robust discrete optimization and network flows
Robust discrete optimization and network flows
2003,
We propose an approach to address data uncertainty for discrete optimization and...
On the convergence of Newton iterations to non-stationary points
On the convergence of Newton iterations to non-stationary points
2004,
We study conditions under which line search Newton methods for nonlinear systems of...
On unions and dominants of polytopes
On unions and dominants of polytopes
2004,
A well-known result on unions of polyhedra in the same space gives an extended...
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
2004,
In this paper we present a primal–dual inexact infeasible interior-point...
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
2004,
In this paper we focus on the problem of identifying the index sets P(x) :=...
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
2004,
The accumulation of the Jacobian matrix F′ of a vector function F : ℝ n...
Sub-quadratic convergence of a smoothing Newton algorithm for the P0- and monotone linear complementarity problem
Sub-quadratic convergence of a smoothing Newton algorithm for the P0- and monotone linear complementarity problem
2004,
Given M ∈ ℜ n×n and q ∈ ℜ n , the linear complementarity...
A study of the lot-sizing polytope
A study of the lot-sizing polytope
2004,
The lot-sizing polytope is a fundamental structure contained in many practical...
Augmented non-quadratic penalty algorithms
Augmented non-quadratic penalty algorithms
2004,
Auslender, Cominetti and Haddou have studied, in the convex case, a new family of...
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
2004,
We consider semidefinite monotone linear complementarity problems (SDLCP) in the space...
Regularities and their relations to error bounds
Regularities and their relations to error bounds
2004,
In this paper, we mainly study various notions of regularity for a finite collection...
Max algebra and the linear assignment problem
Max algebra and the linear assignment problem
2003,
Max-algebra, where the classical arithmetic operations of addition and multiplication...
Tight formulations for some simple mixed integer programs and convex objective integer programs
Tight formulations for some simple mixed integer programs and convex objective integer programs
2003,
We study the polyhedral structure of simple mixed integer sets that generalize the two...
Papers per page: