2005

2005: IPCO XI in Berlin, Germany Website Program Committee: Michael Juenger, PC-chair, Universitaet zu Koeln Michele Conforti, University of Padova Jesus De Loera, UC Davis Andras Frank, ELU Budapest Dorit Hochbaum, UC Berkeley Volker Kaibel, TU Berlin Adam Letchford, Lancaster University Rolf Moehring, TU Berlin Petra Mutzel, TU Wien Maurice Queyranne, University of British Columbia Franz Rendl, Universitaet Klagenfurt Bruce Shepherd, Bell Labs List of accepted papers: E. Amaldi, P. Belotti, R. Hauser. Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. Andreas Bley. On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. Agustin Bompadre, James B. Orlin. Using Grammars to Generate Very Large Scale Neighborhoods for the TSP and Other Sequencing Problems. Andreas Brandstaedt, Chinh T. Hoang. On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. Alberto Caprara, Marco Locatelli, Michele Monaci. Bidimensional Packing by Bilinear Programming. Fabian Chudak, Vania Eleuterio. Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. William Cook, Daniel Espinoza, Marcos Goycoolea. A Study of Domino-Parity and k-Parity Constraints for the TSP. Jose Rafael Correa, Andreas S. Schulz, Nicolas Stier. On the Inefficiency of Equilibria in Congestion Games. Jose R. Correa, Michael R. Wagner. LP-Based Online Scheduling: From Single to Parallel Machines. Kedar Dhamdhere, R. Ravi, Mohit Singh. On two-stage Stochastic Minimum Spanning Trees. Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura. Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta. Approximate Min-Max Relations for Odd Cycles in Planar Graphs. Matteo Fischetti, Andrea Lodi. Optimizing over the First Chvatal Closure. Matteo Fischetti, Cristiano Saturni. Mixed-Integer Cuts from Cyclic Groups. Harold Gabow. On the L-infinity Norm of Extreme Points for Crossing Supermodular Directed Network LPs. Bernd Gaertner, Walter D. Morris Jr., Leo Ruest. Unique Sink Orientations of Grids. Alexander Grigoriev, Maxim Sviridenko, Marc Uetz. Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. Yongpei Guan, Shabbir Ahmed, George L. Nemhauser. Sequential Pairing of Mixed Integer Inequalities. Prabhakar Gubbala, Balaji Raghavachari. Approximation Algorithms for Minimum Cardinality Two-Connected Spanning Subgraph Problem. Nebojsa Gvozdenovic, Monique Laurent. Semidefinite Bounds for the Stability Number of a Graph Via Sums of Squares of Polynomials. Cor Hurkens, Judith Keijsper, Leen Stougie. Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. Satoru Iwata, Ryo Shimizu. Combinatorial Analysis of Generic Matrix Pencils. Garud Iyengar, David Phillips, Cliff Stein. Approximation Algorithms for Semidefinite Packing Problems with Applications to MAXCUT and Graph Coloring. Naonori Kakimura, Satoru Iwata. Computing the Inertia from Sign Patterns. Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov. Power Optimization for Connectivity Problems. Lap Chi Lau. Packing Steiner Forests. Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys. Inventory and Facility Location Models with Market Selection. Retsef Levi, Martin Pal, Robin Roundy, David B. Shmoys. Approximation Algorithms for Stochastic Inventory Control Models. Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis. Not Every GTSP Facet Induces an STSP Facet. Gyula Pap. A Combinatorial Algorithm to Find a Maximum Even Factor. Heiko Roeglin, Berthold Voecking. Smoothed Analysis of Integer Programming. Mohammad R. Salavatipour, Jacques Verstraete. Disjoint Cycles: Integrality Gap, Hardness, and Approximation. Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye. On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations. Tibor Szabo, Ingo Schurr. Jumping Doesn`t Help in Abstract Cubes.