Abstract
We define a purely geometrical notion of the rank of (mixed-) integer rational polyhedra that differs substantially from the existing notions found in the literature.
This is a preview of subscription content, log in via an institution to check access.
References
Cook W., Kannan R., Schrijver A.: Chvatal closures for mixed-integer programming problems. Math. Prog. 47, 155–174 (1990)
Cornuejols G., Li Y.: On the rank of mixed 0–1 polyhedra. Math. Prog. 91, 391–397 (2002)
Nemhauser G., Wolsey L.: A recursive procedure to generate all cuts for 0–1 mixed integer programs. Math. Prog. 46, 379–390 (1990)
Padberg M.W.: Linear Optimization and Extensions. 2nd edn. Springer, Berlin (1999)
Padberg, M.W.: Classical cuts for mixed-integer programming and branch-and-cut. Math. Meth. O.R. 53, 173–203 (2001), [reprinted in Ann. O.R. 139, 321–352 (2005)]
Padberg M.W.: Mixed-integer programming—1968 and thereafter. Ann. O.R. 149, 163–175 (2007)
Padberg, M.W.: Facets and rank of integer polyhedra. Working paper, presented in preliminary form in a plenary session at the XVIth ISMP in August 1997 at the EPFL in Lausanne (Switzerland) under the title “Facets, Rank of Integer Polyhedra and Other Topics” (2011)