default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. IPCO 2005: Berlin, Germany
- Michael Jünger, Volker Kaibel:
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Lecture Notes in Computer Science 3509, Springer 2005, ISBN 3-540-26199-0 - Matteo Fischetti, Cristiano Saturni:
Mixed-Integer Cuts from Cyclic Groups. 1-11 - Matteo Fischetti, Andrea Lodi:
Optimizing over the First Chvàtal Closure. 12-22 - Yongpei Guan, Shabbir Ahmed, George L. Nemhauser:
Sequential Pairing of Mixed Integer Inequalities. 23-34 - Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. 35-50 - Mohammad R. Salavatipour, Jacques Verstraëte:
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. 51-65 - Gyula Pap:
A Combinatorial Algorithm to Find a Maximum Even Factor. 66-80 - Fabián A. Chudak, Vânia Eleutério:
Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. 81-96 - Andreas Bley
:
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. 97-110 - Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys:
Inventory and Facility Location Models with Market Selection. 111-124 - Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations. 125-135 - Nebojsa Gvozdenovic, Monique Laurent:
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials. 136-151 - Garud Iyengar, David J. Phillips, Clifford Stein:
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. 152-166 - José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
On the Inefficiency of Equilibria in Congestion Games. 167-181 - Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. 182-195 - José R. Correa, Michael R. Wagner:
LP-Based Online Scheduling: From Single to Parallel Machines. 196-209 - Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
Unique Sink Orientations of Grids. 210-224 - Ingo Schurr, Tibor Szabó:
Jumping Doesn't Help in Abstract Cubes. 225-235 - Naonori Kakimura, Satoru Iwata:
Computing the Inertia from Sign Patterns. 236-248 - Edoardo Amaldi, Pietro Belotti, Raphael Hauser:
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. 249-264 - Andreas Brandstädt, Chính T. Hoàng:
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. 265-275 - Heiko Röglin, Berthold Vöcking:
Smoothed Analysis of Integer Programming. 276-290 - Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. 291-305 - Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. 306-320 - Kedar Dhamdhere, R. Ravi, Mohit Singh:
On Two-Stage Stochastic Minimum Spanning Trees. 321-334 - Satoru Iwata, Ryo Shimizu:
Combinatorial Analysis of Generic Matrix Pencils. 335-348 - Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power Optimization for Connectivity Problems. 349-361 - Lap Chi Lau:
Packing Steiner Forests. 362-376 - Alberto Caprara, Marco Locatelli, Michele Monaci:
Bidimensional Packing by Bilinear Programming. 377-391 - Harold N. Gabow:
On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. 392-406 - Cor A. J. Hurkens, Judith Keijsper, Leen Stougie:
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. 407-421 - Prabhakar Gubbala, Balaji Raghavachari:
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. 422-436 - Agustín Bompadre, James B. Orlin:
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. 437-451 - William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
A Study of Domino-Parity and k-Parity Constraints for the TSP. 452-467 - Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet. 468-482
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
