IPCO B

35 papers

YearTitle / Authors
2005A Combinatorial Algorithm to Find a Maximum Even Factor.
Gyula Pap
2005A Study of Domino-Parity and k-Parity Constraints for the TSP.
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
2005Approximate Min-max Relations for Odd Cycles in Planar Graphs.
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2005Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.
Garud Iyengar, David J. Phillips, Clifford Stein
2005Approximation Algorithms for Stochastic Inventory Control Models.
Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
2005Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem.
Prabhakar Gubbala, Balaji Raghavachari
2005Bidimensional Packing by Bilinear Programming.
Alberto Caprara, Marco Locatelli, Michele Monaci
2005Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2005Combinatorial Analysis of Generic Matrix Pencils.
Satoru Iwata, Ryo Shimizu
2005Computing the Inertia from Sign Patterns.
Naonori Kakimura, Satoru Iwata
2005Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
Mohammad R. Salavatipour, Jacques Verstraëte
2005Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.
Fabián A. Chudak, Vânia Eleutério
2005Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Michael Jünger, Volker Kaibel
2005Inventory and Facility Location Models with Market Selection.
Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
2005Jumping Doesn't Help in Abstract Cubes.
Ingo Schurr, Tibor Szabó
2005LP-Based Online Scheduling: From Single to Parallel Machines.
José R. Correa, Michael R. Wagner
2005Mixed-Integer Cuts from Cyclic Groups.
Matteo Fischetti, Cristiano Saturni
2005Not Every GTSP Facet Induces an STSP Facet.
Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
2005On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations.
Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye
2005On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.
Andreas Brandstädt, Chính T. Hoàng
2005On Two-Stage Stochastic Minimum Spanning Trees.
Kedar Dhamdhere, R. Ravi, Mohit Singh
2005On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.
Andreas Bley
2005On the Inefficiency of Equilibria in Congestion Games.
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
2005On the L
Harold N. Gabow
2005Optimizing over the First Chvàtal Closure.
Matteo Fischetti, Andrea Lodi
2005Packing Steiner Forests.
Lap Chi Lau
2005Power Optimization for Connectivity Problems.
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
2005Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.
Edoardo Amaldi, Pietro Belotti, Raphael Hauser
2005Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.
Nebojsa Gvozdenovic, Monique Laurent
2005Sequential Pairing of Mixed Integer Inequalities.
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
2005Smoothed Analysis of Integer Programming.
Heiko Röglin, Berthold Vöcking
2005Unique Sink Orientations of Grids.
Bernd Gärtner, Walter D. Morris Jr., Leo Rüst
2005Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
2005Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.
Agustín Bompadre, James B. Orlin
2005Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks.
Cor A. J. Hurkens, Judith Keijsper, Leen Stougie