Sciweavers

2 search results - page 1 / 1
» Convex hulls of superincreasing knapsacks and lexicographic ...
Sort
View
IPCO
2007
143views Optimization» more  IPCO 2007»
13 years 6 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 6 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos