Keyword: cutting plane algorithms

Found 65 papers in total
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Enumeration of the facets of cut polytopes over some highly symmetric graphs
2016,
We report here a computation giving the complete list of facets for the cut polytopes...
MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
2014,
In this study we deal with the two‐dimensional non‐guillotine cutting...
Experiments with Two‐Row Cuts from Degenerate Tableaux
Experiments with Two‐Row Cuts from Degenerate Tableaux
2011,
There has been a recent interest in cutting planes generated from two or more rows of...
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
2011,
We consider mixed integer linear sets defined by two equations involving two integer...
On the membership problem for the {1,1/2}‐closure
On the membership problem for the {1,1/2}‐closure
2011,
Zero‐half cuts are a class of cutting planes for integer programming problems....
Pivot‐and‐reduce cuts: An approach for improving Gomory mixed‐integer cuts
Pivot‐and‐reduce cuts: An approach for improving Gomory mixed‐integer cuts
2011,
Gomory mixed‐integer cuts are of crucial importance in solving...
A note on the MIR closure and basic relaxations of polyhedra
A note on the MIR closure and basic relaxations of polyhedra
2011,
Anderson et al. (2005) show that for a polyhedral mixed integer set defined by a...
Finite Disjunctive Programming Characterizations for General Mixed‐Integer Linear Programs
Finite Disjunctive Programming Characterizations for General Mixed‐Integer Linear Programs
2011,
In this paper, we give a finite disjunctive programming procedure to obtain the convex...
RAMP for the capacitated minimum spanning tree problem
RAMP for the capacitated minimum spanning tree problem
2010,
This paper introduces dual and primal-dual RAMP algorithms for the solution of the...
An efficient descent direction method with cutting planes
An efficient descent direction method with cutting planes
2010,
In this paper, a new hybrid method is proposed which combines the advantages of...
On degenerate multi-row Gomory cuts
On degenerate multi-row Gomory cuts
2009,
Borozan and Cornuéjols show that valid inequalities for an infinite relaxation...
Computational experience with general cutting planes for the Set Covering problem
Computational experience with general cutting planes for the Set Covering problem
2009,
In this paper we present a cutting plane algorithm for the Set Covering problem....
Cutting plane algorithms for the inverse mixed integer linear programming problem
Cutting plane algorithms for the inverse mixed integer linear programming problem
2009,
We present cutting plane algorithms for the inverse mixed integer linear programming...
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
2009,
The Perspective Reformulation generates tight approximations to MINLP problems with...
On the complexity of cutting-plane proofs using split cuts
On the complexity of cutting-plane proofs using split cuts
2010,
We prove a monotone interpolation property for split cuts which, together with results...
Computing with multi-row Gomory cuts
Computing with multi-row Gomory cuts
2010,
Recent advances on the understanding of valid inequalities from the infinite group...
Local cuts revisited
Local cuts revisited
2008,
We present a variant of the local cut generation procedure by Applegate, Bixby,...
Numerically safe Gomory mixed-integer cuts
Numerically safe Gomory mixed-integer cuts
2009,
We describe a simple process for generating numerically safe cutting planes using...
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
2009,
We propose an approximate lifting procedure for general integer programs. This lifting...
A sequential cutting plane algorithm for solving convex NLP problems
A sequential cutting plane algorithm for solving convex NLP problems
2006,
In this paper we look at a new algorithm for solving convex nonlinear programming...
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
2007,
This paper presents two linear cutting plane algorithms that refine existing methods...
An algorithm for solving the convex feasibility problem
An algorithm for solving the convex feasibility problem
2007,
This paper presents a volumetric cutting plane algorithm for finding a feasible point...
Reduce-and-split cuts: improving the performance of mixed-integer Gomory cuts
Reduce-and-split cuts: improving the performance of mixed-integer Gomory cuts
2005,
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software...
Generating cutting planes for mixed integer programming problems in a parallel computing environment
Generating cutting planes for mixed integer programming problems in a parallel computing environment
2004,
A parallel implementation of a disjunctive cutting-plane algorithm in a distributed...
Papers per page: