Conferences in DBLP
Matteo Fischetti , Cristiano Saturni Mixed-Integer Cuts from Cyclic Groups. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:1-11 [Conf ] Matteo Fischetti , Andrea Lodi Optimizing over the First Chvàtal Closure. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:12-22 [Conf ] Yongpei Guan , Shabbir Ahmed , George L. Nemhauser Sequential Pairing of Mixed Integer Inequalities. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:23-34 [Conf ] Samuel Fiorini , Nadia Hardy , Bruce A. Reed , Adrian Vetta Approximate Min-max Relations for Odd Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:35-50 [Conf ] Mohammad R. Salavatipour , Jacques Verstraëte Disjoint Cycles: Integrality Gap, Hardness, and Approximation. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:51-65 [Conf ] Gyula Pap A Combinatorial Algorithm to Find a Maximum Even Factor. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:66-80 [Conf ] Fabián A. Chudak , Vânia Eleutério Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:81-96 [Conf ] Andreas Bley On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:97-110 [Conf ] Retsef Levi , Joseph Geunes , H. Edwin Romeijn , David B. Shmoys Inventory and Facility Location Models with Market Selection. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:111-124 [Conf ] Anthony Man-Cho So , Jiawei Zhang , Yinyu Ye On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:125-135 [Conf ] Nebojsa Gvozdenovic , Monique Laurent Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:136-151 [Conf ] G. Iyengar , David J. Phillips , Clifford Stein Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:152-166 [Conf ] José R. Correa , Andreas S. Schulz , Nicolás E. Stier Moses On the Inefficiency of Equilibria in Congestion Games. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:167-181 [Conf ] Alexander Grigoriev , Maxim Sviridenko , Marc Uetz Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:182-195 [Conf ] José R. Correa , Michael R. Wagner LP-Based Online Scheduling: From Single to Parallel Machines. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:196-209 [Conf ] Bernd Gärtner , Walter D. Morris , Leo Rüst Unique Sink Orientations of Grids. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:210-224 [Conf ] Ingo Schurr , Tibor Szabó Jumping Doesn't Help in Abstract Cubes. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:225-235 [Conf ] Naonori Kakimura , Satoru Iwata Computing the Inertia from Sign Patterns. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:236-248 [Conf ] Edoardo Amaldi , Pietro Belotti , Raphael Hauser Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:249-264 [Conf ] Andreas Brandstädt , Chính T. Hoàng On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:265-275 [Conf ] Heiko Röglin , Berthold Vöcking Smoothed Analysis of Integer Programming. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:276-290 [Conf ] Friedrich Eisenbrand , Gianpaolo Oriolo , Gautier Stauffer , Paolo Ventura Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:291-305 [Conf ] Retsef Levi , Martin Pál , Robin Roundy , David B. Shmoys Approximation Algorithms for Stochastic Inventory Control Models. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:306-320 [Conf ] Kedar Dhamdhere , R. Ravi , Mohit Singh On Two-Stage Stochastic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:321-334 [Conf ] Satoru Iwata , Ryo Shimizu Combinatorial Analysis of Generic Matrix Pencils. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:335-348 [Conf ] Mohammad Taghi Hajiaghayi , Guy Kortsarz , Vahab S. Mirrokni , Zeev Nutov Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:349-361 [Conf ] Lap Chi Lau Packing Steiner Forests. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:362-376 [Conf ] Alberto Caprara , Marco Locatelli , Michele Monaci Bidimensional Packing by Bilinear Programming. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:377-391 [Conf ] Harold N. Gabow On the Linfinity -Norm of Extreme Points for Crossing Supermodular Directed Network LPs. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:392-406 [Conf ] Cor A. J. Hurkens , Judith Keijsper , Leen Stougie Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:407-421 [Conf ] Prabhakar Gubbala , Balaji Raghavachari Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:422-436 [Conf ] Agustin Bompadre , James B. Orlin Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:437-451 [Conf ] William Cook , Daniel Espinoza , Marcos Goycoolea A Study of Domino-Parity and k-Parity Constraints for the TSP. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:452-467 [Conf ] Marcus Oswald , Gerhard Reinelt , Dirk Oliver Theis Not Every GTSP Facet Induces an STSP Facet. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:468-482 [Conf ]