Abstract is missing.
- A Faster Scaling Algorithm for Minimizing Submodular FunctionsSatoru Iwata. 1-8 [doi]
- A Generalization of Edmonds Matching and Matroid Intersection AlgorithmsBianca Spille, Robert Weismantel. 9-20 [doi]
- A Coordinatewise Domain Scaling Algorithm for M-convex Function MinimizationAkihisa Tamura. 21-35 [doi]
- The Quickest Multicommodity Flow ProblemLisa Fleischer, Martin Skutella. 36-53 [doi]
- A New Min-Cut Max-Flow Ratio for Multicommodity FlowsOktay Günlük. 54-66 [doi]
- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT ProblemsMichael Lewin, Dror Livnat, Uri Zwick. 67-82 [doi]
- Finding the Exact Integrality Gap for Small Traveling Salesman ProblemsSylvia C. Boyd, Geneviève Labonté. 83-92 [doi]
- Polynomial-Time Separation of Simple Comb InequalitiesAdam N. Letchford, Andrea Lodi. 93-108 [doi]
- A New Approach to Cactus Construction Applied to TSP Support GraphsKlaus Michael Wenger. 109-126 [doi]
- Split Closure and Intersection CutsKent Andersen, Gérard Cornuéjols, Yanjun Li. 127-144 [doi]
- An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut ProofsSanjeeb Dash. 145-160 [doi]
- Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and AlgorithmsJean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser. 161-175 [doi]
- On a Lemma of ScarfRon Aharoni, Tamás Fleiner. 176-187 [doi]
- A Short Proof of Seymour s Characterization of the Matroids with the Max-Flow Min-Cut PropertyBertrand Guenin. 188-193 [doi]
- Integer Programming and Arrovian Social Welfare FunctionsJay Sethuraman, Chung-Piaw Teo, Rakesh Vohra. 194-211 [doi]
- Integrated Logistics: Approximation Algorithms Combining Facility Location and Network DesignRavi Ramamoorthi, Amitabh Sinha II. 212-229 [doi]
- The Minimum Latency Problem Is NP-Hard for Weighted TreesRené Sitters. 230-239 [doi]
- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemMaxim Sviridenko. 240-257 [doi]
- A Polyhedral Approach to Surface Reconstruction from Planar ContoursErnst Althaus, Christian Fink. 258-272 [doi]
- The Semidefinite Relaxation of the k -Partition Polytope Is StrongAndreas Eisenblätter. 273-290 [doi]
- A Polyhedral Study of the Cardinality Constrained Knapsack ProblemIsmael R. de Farias Jr., George L. Nemhauser. 291-303 [doi]
- A PTAS for Minimizing Total Completion Time of Bounded Batch SchedulingMao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu. 304-314 [doi]
- An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing ProblemAlberto Caprara, Andrea Lodi, Michele Monaci. 315-328 [doi]
- On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation SchemesKlaus Jansen, Lorant Porkolab. 329-349 [doi]
- Hard Equality Constrained Integer KnapsacksKaren Aardal, Arjen K. Lenstra. 350-366 [doi]
- The Distribution of Values in the Quadratic Assignment ProblemAlexander I. Barvinok, Tamon Stephen. 367-383 [doi]
- A New Subadditive Approach to Integer ProgrammingDiego Klabjan. 384-400 [doi]
- Improved Approximation Algorithms for Resource AllocationGruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani. 401-414 [doi]
- Approximating the Advertisement Placement ProblemAri Freund, Joseph Naor. 415-424 [doi]
- Algorithms for Minimizing Response Time in Broadcast SchedulingRajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan. 425-438 [doi]
- Building Edge-Failure Resilient NetworksChandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz. 439-456 [doi]
- The Demand Matching ProblemF. Bruce Shepherd, Adrian Vetta. 457-474 [doi]
- The Single-Sink Buy-at-Bulk LP Has Constant Integrality GapKunal Talwar. 475-486 [doi]