Keyword: cutting plane algorithms

Found 65 papers in total
A new linearization method for quadratic assignment problems
A new linearization method for quadratic assignment problems
2006,
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Depth-optimized convexity cuts
Depth-optimized convexity cuts
2005,
This paper presents a general, self-contained treatment of convexity or intersection...
A conditional logic approach for strengthening mixed 0–1 linear programs
A conditional logic approach for strengthening mixed 0–1 linear programs
2005,
We study a conditional logic approach for tightening the continuous relaxation of a...
Classical cuts for mixed-integer programming and branch-and-cut
Classical cuts for mixed-integer programming and branch-and-cut
2005,
We review classical valid linear inequalities for mixed-integer programming, i.e.,...
A cutting algorithm for the quadratic assignment problem
A cutting algorithm for the quadratic assignment problem
2003,
We address the Quadratic Assignment Problem following a polyhedral method. We consider...
Cutting planes from a mixed integer Farkas lemma
Cutting planes from a mixed integer Farkas lemma
2004,
We present a mixed integer version of the lattice analogue of the Farkas lemma. It...
Polynomial interior point cutting plane methods
Polynomial interior point cutting plane methods
2003,
Polynomial cutting plane methods based on the logarithmic barrier function and on the...
Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems
Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems
2003,
Dantzig, Fulkerson, and Johnson introduced the cutting-plane method as a means of...
Corner Polyhedra and their connection with cutting planes
Corner Polyhedra and their connection with cutting planes
2003,
We review the necessary background on Corner Polyhedra and use this to show how...
T-space and cutting planes
T-space and cutting planes
2003,
In this paper we show how knowledge about T-space translates directly into cutting...
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming
2003,
We establish a precise correspondence between lift-and-project cuts for mixed...
Cutting planes and the elementary closure in fixed dimension
Cutting planes and the elementary closure in fixed dimension
2001,
The elementary closure P ′ of a polyhedron P is the intersection of P with all...
On Vaidya's volumetric cutting plane method for convex programming
On Vaidya's volumetric cutting plane method for convex programming
1997,
We describe a simplified and strengthened version of Vaidya's volumetric cutting plane...
An analytic center cutting plane method for semidefinite feasibility problems
An analytic center cutting plane method for semidefinite feasibility problems
2002,
Semidefinite feasibility problems arise in many areas of operations research. The...
Foundation-penalty cuts for mixed-integer programs
Foundation-penalty cuts for mixed-integer programs
2003,
We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to...
Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints
Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints
2002,
We analyze three variants of analytic barrier methods for minimization of a convex...
A disjunctive cutting plane procedure for general mixed-integer linear programs
A disjunctive cutting plane procedure for general mixed-integer linear programs
2001,
In this paper we develop a cutting plane algorithm for solving mixed-integer linear...
A long-step, cutting plane algorithm for linear and convex programming
A long-step, cutting plane algorithm for linear and convex programming
2000,
A cutting plane method for linear programming is described. This method is an...
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
2000,
Let VIP( F, C ) denote the variational inequality problem associated with the mapping...
Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
2000,
For nearly 30 years, Lagrangean relaxation has been extensively used in integer...
A cutting plane method for linear bilevel programs
A cutting plane method for linear bilevel programs
1998,
In this paper, a cutting plane method is presented for solving the linear BLPP. An...
Shallow, deep and very deep cuts in the analytic center cutting plane method
Shallow, deep and very deep cuts in the analytic center cutting plane method
1999,
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable...
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
1997,
A cutting plane algorithm is presented for finding ϵ-appropriate solutions to...
Papers per page: