A maximal lattice free polyhedron L has max-facet-width equal to w if \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $\max_{x \in L} \pi^T x - \min_{x \in L} \pi^T x \leq w$ \end{document} for all facets \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $\pi^T x \leq \pi_0$ \end{document} of L, and \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usep...
[1]
Gérard Cornuéjols,et al.
Valid inequalities for mixed integer linear programs
,
2007,
Math. Program..
[2]
Kent Andersen,et al.
Split closure and intersection cuts
,
2002,
Math. Program..
[3]
R. Tyrrell Rockafellar,et al.
Convex Analysis
,
1970,
Princeton Landmarks in Mathematics and Physics.
[4]
Egon Balas.
Disjunctive Programming
,
2010,
50 Years of Integer Programming.
[5]
Claus-Peter Schnorr,et al.
Geometry of Numbers and Integer Programming (Summary)
,
1988,
STACS.
[6]
Kent Andersen,et al.
Certificates of linear mixed integer infeasibility
,
2008,
Oper. Res. Lett..
[7]
William J. Cook,et al.
Chvátal closures for mixed integer programming problems
,
1990,
Math. Program..
[8]
Egon Balas,et al.
Intersection Cuts - A New Type of Cutting Planes for Integer Programming
,
1971,
Oper. Res..