Journal: Mathematical Programming

Found 797 papers in total
Epsilon-proximal decomposition method
Epsilon-proximal decomposition method
2004,
We propose a modification of the proximal decomposition method investigated by...
Complexity of convex optimization using geometry-based measures and a reference point
Complexity of convex optimization using geometry-based measures and a reference point
2004,
Our concern lies in solving the following convex problem: G P : minimize x c T x s.t....
Duality gap in convex programming
Duality gap in convex programming
2004,
In this paper, we consider general convex programming problems and give a sufficient...
The design of corporate tax structures
The design of corporate tax structures
2003,
We consider the corporate tax structuring problem (TaxSP), a combinatorial...
Exploiting orbits in symmetric Integer Linear Program
Exploiting orbits in symmetric Integer Linear Program
2003,
This paper describes components of a branch-and-cut algorithm for solving integer...
Local branching
Local branching
2003,
The availability of effective exact or heuristic solution methods for general...
Lifted inequalities for 0–1 mixed integer programming: Basic theory and algorithms
Lifted inequalities for 0–1 mixed integer programming: Basic theory and algorithms
2003,
We study the polyhedral structure of simple mixed integer sets that generalize the two...
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
2003,
We study the mixed 0–1 knapsack polytope, which is defined by a single knapsack...
On the facets of the mixed-integer knapsack polyhedron
On the facets of the mixed-integer knapsack polyhedron
2003,
We study the mixed-integer knapsack polyhedron, that is, the convex hull of the...
Facets of the independent set polytope
Facets of the independent set polytope
2003,
Theoretical results pertaining to the independent set polytope P ISP...
Binary clutter inequalities for integer programs
Binary clutter inequalities for integer programs
2003,
We introduce a new class of valid inequalities for general integer linear programs,...
Parallel branch, cut, and price for large-scale discrete optimization
Parallel branch, cut, and price for large-scale discrete optimization
2003,
In discrete optimization, most exact solution approaches are based on branch and...
An algorithm for mixed integer optimization
An algorithm for mixed integer optimization
2003,
This paper introduces a new algorithm for solving mixed integer programs. The core of...
The stable set problem and the lift-and-project ranks of graphs
The stable set problem and the lift-and-project ranks of graphs
2003,
We study the lift-and-project procedures for solving combinatorial optimization...
Detecting symmetries by branch and cut
Detecting symmetries by branch and cut
2003,
The NP-hard problem of finding symmetries in an abstract graph plays an important role...
Models and algorithms for a staff scheduling problem
Models and algorithms for a staff scheduling problem
2003,
We present mathematical models and solutions algorithms for a family of staff...
Approximation algorithms for the test cover problem
Approximation algorithms for the test cover problem
2003,
In the test cover problem a set of m items is given together with a collection of...
Approximating disjoint-path problems using packing integer programs
Approximating disjoint-path problems using packing integer programs
2004,
In a packing integer program, we are given a matrix A and column vectors b, c with...
Safe bounds in linear and mixed-integer linear programming
Safe bounds in linear and mixed-integer linear programming
2004,
Current mixed-integer linear programming solvers are based on linear programming...
Proximity theorems of discrete convex functions
Proximity theorems of discrete convex functions
2004,
A proximity theorem is a statement that, given an optimization problem and its...
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
2004,
Cholesky factorization has become the method of choice for solving the symmetric...
Solving linear programs with finite precision: I. Condition numbers and random programs
Solving linear programs with finite precision: I. Condition numbers and random programs
2004,
We define a condition number 𝒦 ( A, b,c ) for a linear program min c T x s.t. Ax...
Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing
Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing
2004,
The paper considers an example of Wächter and Biegler which is shown to converge...
The Broyden–Fletcher–Goldfarb–Shanno method with exact line searches fails for non-convex objective functions
The Broyden–Fletcher–Goldfarb–Shanno method with exact line searches fails for non-convex objective functions
2004,
This work shows that the BFGS method and other methods in the Broyden class, with...
Papers per page: