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

DOI10.1023/A:1021320028145zbMath1013.90099OpenAlexW74681859MaRDI QIDQ1854777

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

cutting planesbranch-and-cutdisjunctive cuts0-1 integer programminglift-and-project

Mathematics Subject Classification ID

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

Related Items (2)

Computing deep facet-defining disjunctive cuts for mixed-integer programming ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

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