Integer Programming and Combinatorial Optimization

DOI10.1007/B97946MaRDI QIDQ5712469zbMATH OpenOpenAlexFDO

Authors Sanjeeb Dash, Oktay Günlük

Publication date 23 December 2005

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

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

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

Recommendations

• Valid inequalities based on simple mixed-integer sets
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• Valid inequalities for mixed 0-1 programs
• Valid inequalities for mixed integer linear programs

Cited in

(8)

• On the extreme inequalities of infinite group problems
• scientific article; zbMATH DE number 1342120 (Why is no real title available?)
• Constrained infinite group relaxations of MIPs
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• Cover and pack inequalities for (mixed) integer programming
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Valid inequalities based on simple mixed-integer sets
• Valid inequalities for problems with additive variable upper bounds

This page was built for publication: Integer Programming and Combinatorial Optimization

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