13. IPCO 2008: Bertinoro, Italy

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

Last update Fri May 25 08:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page