Convex normalizations in lift-and-project methods for 0--1 programming

DOI10.1023/A:1021320028145MaRDI QIDQ1854777zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 January 2003

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021320028145

zbMATH Keywords

0-1 integer programmingbranch-and-cutcutting planesdisjunctive cutslift-and-project

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Lift-and-project for mixed 0-1 programming: recent progress
• scientific article; zbMATH DE number 437548
• A modified lift-and-project procedure
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Cited in

(4)

• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
• Sparsity of lift-and-project cutting planes
• Computing deep facet-defining disjunctive cuts for mixed-integer programming

This page was built for publication: Convex normalizations in lift-and-project methods for 0--1 programming

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