- 2008
- Aaron Archer, Shankar Krishnan:
Importance Sampling via Load-Balanced Facility Location. IPCO 2008: 316-330 - Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
:
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. IPCO 2008: 112-124 - André Berger
, Vincenzo Bonifaci
, Fabrizio Grandoni, Guido Schäfer:
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 - Attila Bernáth, Tamás Király:
A New Approach to Splitting-Off. IPCO 2008: 401-415 - Dimitris Bertsimas, Guglielmo Lulli
, Amedeo R. Odoni:
The Air Traffic Flow Management Problem: An Integer Optimization Approach. IPCO 2008: 34-46 - Tim Carnes, David B. Shmoys:
Primal-Dual Schema for Capacitated Covering Problems. IPCO 2008: 288-302 - Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358 - Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Divisible Capacities. IPCO 2008: 435-449 - Santanu S. Dey
, Laurence A. Wolsey:
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO 2008: 463-475 - Daniel G. Espinoza:
Computing with Multi-row Gomory Cuts. IPCO 2008: 214-224 - Tamás Fleiner:
The Stable Roommates Problem with Choice Functions. IPCO 2008: 385-400 - Konstantinos Georgiou, Avner Magen, Iannis Tourlakis:
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. IPCO 2008: 140-153 - Yongpei Guan, Andrew Miller:
A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging. IPCO 2008: 450-462 - Oktay Günlük, Jeff T. Linderoth:
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO 2008: 1-16 - Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO 2008: 184-198 - Ken-ichi Kawarabayashi:
An Improved Algorithm for Finding Cycles Through Elements. IPCO 2008: 374-384 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Induced Disjoint Paths Problem. IPCO 2008: 47-61 - Tamás Király, Lap Chi Lau, Mohit Singh:
Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272 - Adam N. Letchford
, Michael Malmros Sørensen
:
Binary Positive Semidefinite Matrices and Associated Integer Polytopes. IPCO 2008: 125-139 - Maren Martens, S. Thomas McCormick:
A Polynomial Algorithm for Weighted Abstract Flow. IPCO 2008: 97-111 - Kamesh Munagala
, Peng Shi:
The Stochastic Machine Replenishment Problem. IPCO 2008: 169-183 - Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168 - Chandrashekhar Nagarajan, David P. Williamson:
Offline and Online Facility Leasing. IPCO 2008: 303-315 - Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO 2008: 77-96 - James B. Orlin
:
A Fast, Simpler Algorithm for the Matroid Parity Problem. IPCO 2008: 240-258 - James Ostrowski
, Jeff T. Linderoth, Fabrizio Rossi
, Stefano Smriglio
:
Constraint Orbital Branching. IPCO 2008: 225-239 - Anureet Saxena, Pierre Bonami, Jon Lee
:
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. IPCO 2008: 17-33 - David B. Shmoys, Kunal Talwar:
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. IPCO 2008: 331-343 - Kenjiro Takazawa:
A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs. IPCO 2008: 62-76