default search action
9. IPCO 2002: Cambridge, MA, USA
- William J. Cook, Andreas S. Schulz:
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings. Lecture Notes in Computer Science 2337, Springer 2002, ISBN 3-540-43676-6 - Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions. 1-8 - Bianca Spille, Robert Weismantel:
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. 9-20 - Akihisa Tamura:
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization. 21-35 - Lisa Fleischer, Martin Skutella:
The Quickest Multicommodity Flow Problem. 36-53 - Oktay Günlük:
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. 54-66 - Michael Lewin, Dror Livnat, Uri Zwick:
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. 67-82 - Sylvia C. Boyd, Geneviève Labonté:
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. 83-92 - Adam N. Letchford
, Andrea Lodi:
Polynomial-Time Separation of Simple Comb Inequalities. 93-108 - Klaus Michael Wenger:
A New Approach to Cactus Construction Applied to TSP Support Graphs. 109-126 - Kent Andersen, Gérard Cornuéjols, Yanjun Li:
Split Closure and Intersection Cuts. 127-144 - Sanjeeb Dash:
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. 145-160 - Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. 161-175 - Ron Aharoni, Tamás Fleiner:
On a Lemma of Scarf. 176-187 - Bertrand Guenin:
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. 188-193 - Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra:
Integer Programming and Arrovian Social Welfare Functions. 194-211 - Ravi Ramamoorthi, Amitabh Sinha II:
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design. 212-229 - René Sitters:
The Minimum Latency Problem Is NP-Hard for Weighted Trees. 230-239 - Maxim Sviridenko:
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. 240-257 - Ernst Althaus, Christian Fink:
A Polyhedral Approach to Surface Reconstruction from Planar Contours. 258-272 - Andreas Eisenblätter:
The Semidefinite Relaxation of the k -Partition Polytope Is Strong. 273-290 - Ismael R. de Farias Jr., George L. Nemhauser:
A Polyhedral Study of the Cardinality Constrained Knapsack Problem. 291-303 - Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. 304-314 - Alberto Caprara, Andrea Lodi, Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. 315-328 - Klaus Jansen, Lorant Porkolab:
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. 329-349 - Karen I. Aardal, Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks. 350-366 - Alexander I. Barvinok, Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem. 367-383 - Diego Klabjan:
A New Subadditive Approach to Integer Programming. 384-400 - Gruia Calinescu
Improved Approximation Algorithms for Resource Allocation. 401-414 - Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. 415-424 - Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Minimizing Response Time in Broadcast Scheduling. 425-438 - Chandra Chekuri, Anupam Gupta, Amit Kumar
Building Edge-Failure Resilient Networks. 439-456 - F. Bruce Shepherd, Adrian Vetta:
The Demand Matching Problem. 457-474 - Kunal Talwar:
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. 475-486
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 2024-11-21 20:18 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: