A recursive procedure to generate all cuts for 0-1 mixed integer programs
Mathematical Programming: Series A and B
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
The Steiner tree polytope and related polyhedra
Mathematical Programming: Series A and B
The Steiner tree problem I: formulations, compositions and extension of facets
Mathematical Programming: Series A and B
Computational experience with a difficult mixed-integer multicommodity flow problem
Mathematical Programming: Series A and B
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
Management Science
Disjunctive programming: properties of the convex hull of feasible points
Discrete Applied Mathematics
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
Aggregation and Mixed Integer Rounding to Solve MIPs
Operations Research
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics
Exact MAX-2SAT solution via lift-and-project closure
Operations Research Letters
Elementary closures for integer programs
Operations Research Letters
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Operations Research Letters
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs
Discrete Applied Mathematics
Lift-and-project cuts for mixed integer convex programs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Using symmetry to optimize over the sherali-adams relaxation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation-linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.