Sciweavers

IPCO
2007
85views Optimization» more  IPCO 2007»
14 years 1 months ago
Orbitopal Fixing
Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
IPCO
2007
143views Optimization» more  IPCO 2007»
14 years 1 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
2007
108views Optimization» more  IPCO 2007»
14 years 1 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
IPCO
2007
114views Optimization» more  IPCO 2007»
14 years 1 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth
IPCO
2007
98views Optimization» more  IPCO 2007»
14 years 1 months ago
On a Generalization of the Master Cyclic Group Polyhedron
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günl&uu...
IPCO
2007
87views Optimization» more  IPCO 2007»
14 years 1 months ago
On Integer Programming and the Branch-Width of the Constraint Matrix
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
William H. Cunningham, Jim Geelen
IPCO
2007
77views Optimization» more  IPCO 2007»
14 years 1 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
IPCO
2007
126views Optimization» more  IPCO 2007»
14 years 1 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
IPCO
2007
140views Optimization» more  IPCO 2007»
14 years 1 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan