15. IPCO 2011: New York, NY, USA

• Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti:
  An Excluded Minor Characterization of Seymour Graphs. 1-13
  
• Yu-Hin Au, Levent Tunçel:
  Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. 14-26
  
• Amitabh Basu, Gérard Cornuéjols, Marco Molinaro:
  A Probabilistic Analysis of the Strength of the Split and Triangle Closures. 27-38
  
• Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
  Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. 39-51
  
• Pierre Bonami:
  Lift-and-Project Cuts for Mixed Integer Convex Programs. 52-64
  
• Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
  TSP on Cubic and Subcubic Graphs. 65-77
  
• Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
  Approximability of Capacitated Network Design. 78-91
  
• Deeparnab Chakrabarty, Chaitanya Swamy:
  Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. 92-103
  
• William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
  An Exact Rational Mixed-Integer Programming Solver. 104-116
  
• Claudia D'Ambrosio, Jeff Linderoth, James Luedtke:
  Valid Inequalities for the Pooling Problem with Binary Variables. 117-129
  
• Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
  On the Chvátal-Gomory Closure of a Compact Convex Set. 130-142
  
• Santanu S. Dey, Sebastian Pokutta:
  Design and Verify: A New Scheme for Generating Cutting-Planes. 143-155
  
• Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy:
  Contact Center Scheduling with Strict Resource Requirements. 156-169
  
• Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
  Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. 170-182
  
• Matteo Fischetti, Michele Monaci:
  Backdoor Branching. 183-191
  
• Oliver Friedmann:
  A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. 192-206
  
• Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
  An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. 207-222
  
• Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
  A New Approach to the Stable Set Problem Based on Ellipsoids. 223-234
  
• Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
  Capacitated Vehicle Routing with Non-uniform Speeds. 235-247
  
• Fabrizio Grandoni, Thomas Rothvoß:
  Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. 248-260
  
• Stephan Held, William Cook, Edward C. Sewell:
  Safe Lower Bounds for Graph Coloring. 261-273
  
• Satoru Iwata, Mizuyo Takamatsu:
  Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. 274-286
  
• Volker Kaibel, Kanstantsin Pashkovich:
  Constructing Extended Formulations from Reflection Relations. 287-300
  
• Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
  Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. 301-314
  
• Tamás Király, Lap Chi Lau:
  Degree Bounded Forest Covering. 315-323
  
• S. Thomas McCormick, Britta Peis:
  A Primal-Dual Algorithm for Weighted Abstract Cut Packing. 324-335
  
• Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard:
  Convexification Techniques for Linear Complementarity Constraints. 336-348
  
• Ojas Parekh:
  Iterative Packing for Demand and Hypergraph Matching. 349-361
  
• Britta Peis, Andreas Wiese:
  Universal Packet Routing with Arbitrary Bandwidths and Transit Times. 362-375
  
• Mario Ruthmair, Günther R. Raidl:
  A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. 376-388
  
• José A. Soto, Claudio Telha:
  Jump Number of Two-Directional Orthogonal Ray Graphs. 389-403
  
• Kenjiro Takazawa:
  Optimal Matching Forests and Valuated Delta-Matroids. 404-416
  
• Mathieu Van Vyve:
  Fixed-Charge Transportation on a Path: Linear Programming Formulations. 417-429
  

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