default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. IPCO 2001: Utrecht, The Netherlands
- Karen I. Aardal, Bert Gerards:
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Lecture Notes in Computer Science 2081, Springer 2001, ISBN 3-540-42225-0 - Aaron Archer:
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. 1-14 - Yossi Azar, Oded Regev:
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. 15-29 - Joseph Cheriyan, Santosh S. Vempala:
Edge Covers of Setpairs and the Iterative Rounding Method. 30-44 - Cheng-Feng Mabel Chou
, Maurice Queyranne, David Simchi-Levi:
The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. 45-59 - Fabián A. Chudak, Tim Roughgarden, David P. Williamson:
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. 60-70 - Gérard Cornuéjols, Yanjun Li:
On the Rank of Mixed 0, 1 Polyhedra. 71-77 - Friedrich Eisenbrand, Günter Rote:
Fast 2-Variable Integer Programming. 78-89 - Michael Elkin, David Peleg:
Approximating k-Spanner Problems for k>2. 90-104 - Tamás Fleiner:
A Matroid Generalization of the Stable Matching Polytope. 105-114 - Lisa Fleischer:
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. 115-129 - András Frank, Tamás Király:
Combined Connectivity Augmentation and Orientation Problems. 130-144 - András Frank, László Szegö:
An Extension of a Theorem of Henneberg and Laman. 145-159 - Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. 160-169 - Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II:
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. 170-184 - Bertrand Guenin:
Circuit Mengerian Directed Graphs. 185-195 - Bertrand Guenin:
Integral Polyhedra Related to Even Cycle and Even Cut Matroids. 196-209 - Eran Halperin, Uri Zwick:
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. 210-225 - Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. 226-235 - Arie Hordijk, D. A. van der Laan:
Bounds for Deterministic Periodic Routing Sequences. 236-250 - Garud Iyengar, Mehmet Tolga Çezik:
Cutting Planes for Mixed 0-1 Semidefinite Programs. 251-263 - Bill Jackson, Tibor Jordán:
Independence Free Graphs and Vertex Connectivity Augmentation. 264-279 - Murali S. Kodialam:
The Throughput of Sequential Testing. 280-292 - Jean B. Lasserre:
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. 293-303 - François Margot:
Pruning by Isomorphism in Branch-and-Cut. 304-317 - Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. 318-332 - Alantha Newman, Santosh S. Vempala:
Fences Are Futile: On Relaxations for the Linear Ordering Problem. 333-347 - Michael Perregaard, Egon Balas:
Generating Cuts from Multiple-Term Disjunctions. 348-360 - Maurice Queyranne, Maxim Sviridenko:
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. 361-369 - Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. 370-382 - András Sebö, Eric Tannier:
Connected Joins in Graphs. 383-395 - René Sitters:
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. 396-405 - Clifford Stein, David P. Wagner:
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. 406-422
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-11-26 07:53 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:
