Journal: Mathematical Programming
Local search algorithms for the rectangle packing problem with general spatial costs
We propose local search algorithms for the rectangle packing problem to minimize a...
Stronger linear programming relaxations of max-cut
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
We consider primal–dual algorithms for certain types of infinite-dimensional...
Robust convex quadratically constrained programs
In this paper we study robust convex quadratically constrained programs, a subset of...
Minimal concave cost rebalance of a portfolio to the efficient frontier
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
The number of hospitals in Japan exceeds 10,000, and every month nurses are scheduled...
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
Adam Letchford has defined the Domino Parity inequalities for the Symmetric Traveling...
Lift-and-project cuts and perfect graphs
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
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
We consider the following problem: Given a complete graph G = ( V, E ) with a...
Robust discrete optimization and network flows
We propose an approach to address data uncertainty for discrete optimization and...
On the convergence of Newton iterations to non-stationary points
We study conditions under which line search Newton methods for nonlinear systems of...
On unions and dominants of polytopes
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
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
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
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
Given M ∈ ℜ n×n and q ∈ ℜ n , the linear complementarity...
A study of the lot-sizing polytope
The lot-sizing polytope is a fundamental structure contained in many practical...
Augmented non-quadratic penalty algorithms
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
We consider semidefinite monotone linear complementarity problems (SDLCP) in the space...
Regularities and their relations to error bounds
In this paper, we mainly study various notions of regularity for a finite collection...
Max algebra and the linear assignment problem
Max-algebra, where the classical arithmetic operations of addition and multiplication...
Tight formulations for some simple mixed integer programs and convex objective integer programs
We study the polyhedral structure of simple mixed integer sets that generalize the two...
Papers per page: