Sciweavers

IPCO
2008
136views Optimization» more  IPCO 2008»
13 years 10 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
IPCO
2008
103views Optimization» more  IPCO 2008»
13 years 10 months ago
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Recently, Andersen et al. [1] and Borozan and Cornu
Santanu S. Dey, Laurence A. Wolsey
IPCO
2008
82views Optimization» more  IPCO 2008»
13 years 10 months ago
A New Approach to Splitting-Off
Attila Bernáth, Tamás Király
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 10 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
IPCO
2008
90views Optimization» more  IPCO 2008»
13 years 10 months ago
The Induced Disjoint Paths Problem
Ken-ichi Kawarabayashi, Yusuke Kobayashi
IPCO
2008
103views Optimization» more  IPCO 2008»
13 years 10 months ago
Degree Bounded Matroids and Submodular Flows
Tamás Király, Lap Chi Lau, Mohit Sin...
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 10 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
IPCO
2008
87views Optimization» more  IPCO 2008»
13 years 10 months ago
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
We consider the standard semidefinite programming (SDP) relaxation for vertex cover to which all hypermetric inequalities supported on at most k vertices have been added. We show t...
Konstantinos Georgiou, Avner Magen, Iannis Tourlak...
IPCO
2008
114views Optimization» more  IPCO 2008»
13 years 10 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi