On Cutting Planes
From MaRDI portal
Publication:3883904
DOI10.1016/S0167-5060(08)70085-2zbMath0441.90070MaRDI QIDQ3883904
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Related Items
Polyhedral techniques in combinatorial optimization I: Theory, Elementary closures for integer programs., On the complexity of cutting-plane proofs, Cutting planes in integer and mixed integer programming, Constructive characterizations of the value-function of a mixed-integer program. I, Chvátal closures for mixed integer programming problems, The stable set polytope of quasi-line graphs, Valid inequalities for mixed integer linear programs, Constructive characterizations of the value function of a mixed-integer program. II, Cutting planes in combinatorics, Polyhedral proof methods in combinatorial optimization, Representability in mixed integer programming. I: Characterization results, The Schrijver system of odd join polyhedra, On cutting-plane proofs in combinatorial optimization, The b-hull of an integer program, On total dual integrality, Two mixed integer programming formulations arising in manufacturing management, A primal dual integer programming algorithm, A recursive procedure to generate all cuts for 0-1 mixed integer programs, Cutting-plane proofs in polynomial space, On the Chvátal rank of polytopes in the 0/1 cube, Projected Chvátal-Gomory cuts for mixed integer linear programs, LP extreme points and cuts for the fixed-charge network design problem, Sensitivity theorems in integer linear programming, The value function of an integer program
