The rank of (mixed-) integer polyhedra

DOI10.1007/s10107-011-0500-0zbMath1262.90112OpenAlexW2023246909MaRDI QIDQ1942280

Manfred W. Padberg

Publication date: 18 March 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0500-0

zbMATH Keywords

rankinteger rational polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Polyhedra and polytopes; regular figures, division of spaces (51M20) Geometric constructions in real or complex geometry (51M15)

Related Items (1)

On the geometric rank of matching polytope

Cites Work

• Mixed-integer programming -- 1968 and thereafter
• Chvátal closures for mixed integer programming problems
• Linear optimization and extensions.
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Classical cuts for mixed-integer programming and branch-and-cut
• On the rank of mixed 0,1 polyhedra.

This page was built for publication: The rank of (mixed-) integer polyhedra