MP
2006
13 years 4 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
MP
2008
13 years 4 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
DISOPT
2008
13 years 4 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
4OR
2010
13 years 4 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...