An augment-and-branch-and-cut framework for mixed 0-1 programming

DOI10.1007/3-540-36478-1_12MaRDI QIDQ4414642zbMATH OpenFDO

Authors Adam N. Letchford, Andrea Lodi

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700119.htm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• A branch-and-cut method for 0-1 mixed convex programming
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• A branch-and-cut algorithm for mixed-integer bilinear programming
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Cuts for mixed 0-1 conic programming
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• scientific article; zbMATH DE number 437548
• A MAX-CUT formulation of 0/1 programs

Cited in

(6)

• Solving MIPs via scaling-based augmentation
• Integral simplex using decomposition with primal cutting planes
• \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
• Octane: A New Heuristic for Pure 0–1 Programs
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS

This page was built for publication: An augment-and-branch-and-cut framework for mixed 0-1 programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414642)