On Cutting Planes
From MaRDI portal
Publication:3883904
DOI10.1016/S0167-5060(08)70085-2zbMath0441.90070OpenAlexW2113011069MaRDI QIDQ3883904
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70085-2
Related Items
Polyhedral proof methods in combinatorial optimization, On a Generalization of the Chvátal-Gomory Closure, On the pseudo-periodicity of the integer hull of parametric convex polygons, Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Representability in mixed integer programming. I: Characterization results, The Schrijver system of odd join polyhedra, On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank, Theoretical challenges towards cutting-plane selection, On the polyhedrality of cross and quadrilateral closures, On cutting-plane proofs in combinatorial optimization, On finitely generated closures in the theory of cutting planes, When the Gomory-chvátal closure coincides with the integer hull, Lattice closures of polyhedra, On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube, On the membership problem for the \({0, 1/2}\)-closure, Reverse split rank, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, LP extreme points and cuts for the fixed-charge network design problem, The b-hull of an integer program, Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube, Facet Generating Techniques, On total dual integrality, Sensitivity theorems in integer linear programming, On the Chvátal rank of polytopes in the 0/1 cube, Chvátal closures for mixed integer programming problems, Relaxations of mixed integer sets from lattice-free polyhedra, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, On the Chvátal-Gomory Closure of a Compact Convex Set, On matrices with the Edmonds-Johnson property arising from bidirected graphs, The stable set polytope of quasi-line graphs, Transitive packing, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, On the Chvátal-Gomory closure of a compact convex set, Projected Chvátal-Gomory cuts for mixed integer linear programs, Cutting planes in integer and mixed integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope, Elementary closures for integer programs., On convergence in mixed integer programming, On the complexity of cutting-plane proofs, Understanding cutting planes for QBFs, Aggregation-based cutting-planes for packing and covering integer programs, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, Valid inequalities for mixed integer linear programs, On the rational polytopes with Chvátal rank 1, On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Two mixed integer programming formulations arising in manufacturing management, A recursive procedure to generate all cuts for 0-1 mixed integer programs, Cutting-plane proofs in polynomial space, Polyhedral techniques in combinatorial optimization I: Theory, The aggregation closure is polyhedral for packing and covering integer programs, The value function of an integer program, Constructive characterizations of the value-function of a mixed-integer program. I, A primal dual integer programming algorithm, Constructive characterizations of the value function of a mixed-integer program. II, Computing the integer hull of convex polyhedral sets, Cutting planes in combinatorics, Reflections on Proof Complexity and Counting Principles, On a generalization of the Chvátal-Gomory closure
