IPCO B

33 papers

YearTitle / Authors
2008A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
2008A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem.
David B. Shmoys, Kunal Talwar
2008A Fast, Simpler Algorithm for the Matroid Parity Problem.
James B. Orlin
2008A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2008A New Approach to Splitting-Off.
Attila Bernáth, Tamás Király
2008A Polynomial Algorithm for Weighted Abstract Flow.
Maren Martens, S. Thomas McCormick
2008A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging.
Yongpei Guan, Andrew Miller
2008A Polynomial Time Approximation Scheme for the Square Packing Problem.
Klaus Jansen, Roberto Solis-Oba
2008A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs.
Kenjiro Takazawa
2008An Improved Algorithm for Finding Cycles Through Elements.
Ken-ichi Kawarabayashi
2008Binary Positive Semidefinite Matrices and Associated Integer Polytopes.
Adam N. Letchford, Michael Malmros Sørensen
2008Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle.
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
2008Can Pure Cutting Plane Algorithms Work?.
Arrigo Zanette, Matteo Fischetti, Egon Balas
2008Computing with Multi-row Gomory Cuts.
Daniel G. Espinoza
2008Constraint Orbital Branching.
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
2008Degree Bounded Matroids and Submodular Flows.
Tamás Király, Lap Chi Lau, Mohit Singh
2008Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.
Anureet Saxena, Pierre Bonami, Jon Lee
2008Importance Sampling via Load-Balanced Facility Location.
Aaron Archer, Shankar Krishnan
2008Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings
Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi
2008Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
Santanu S. Dey, Laurence A. Wolsey
2008Min Sum Edge Coloring in Multigraphs Via Configuration LP.
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2008Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.
Juan Pablo Vielma, George L. Nemhauser
2008New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem.
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2008Offline and Online Facility Leasing.
Chandrashekhar Nagarajan, David P. Williamson
2008Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.
Oktay Günlük, Jeff T. Linderoth
2008Primal-Dual Schema for Capacitated Covering Problems.
Tim Carnes, David B. Shmoys
2008The Air Traffic Flow Management Problem: An Integer Optimization Approach.
Dimitris Bertsimas, Guglielmo Lulli, Amedeo R. Odoni
2008The Induced Disjoint Paths Problem.
Ken-ichi Kawarabayashi, Yusuke Kobayashi
2008The Mixing Set with Divisible Capacities.
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2008The Stable Roommates Problem with Choice Functions.
Tamás Fleiner
2008The Stochastic Machine Replenishment Problem.
Kamesh Munagala, Peng Shi
2008Tight Bounds for Permutation Flow Shop Scheduling.
Viswanath Nagarajan, Maxim Sviridenko
2008Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities.
Konstantinos Georgiou, Avner Magen, Iannis Tourlakis