9. IPCO 2002: Cambridge, MA, USA

@proceedings{DBLP:conf/ipco/2002,
  editor    = {William Cook and
               Andreas S. Schulz},
  title     = {Integer Programming and Combinatorial Optimization, 9th International
               IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
  booktitle = {IPCO},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2337},
  year      = {2002},
  isbn      = {3-540-43676-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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