Integer Programming and Combinatorial Optimization de William J. Cook

Integer Programming and Combinatorial Optimization

William J. Cook

Andreas S. Schulz

en Limba Engleză Paperback – 14 mai 2002

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

Citește tot Restrânge

Cuprins

A Faster Scaling Algorithm for Minimizing Submodular Functions.- A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms.- A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization.- The Quickest Multicommodity Flow Problem.- A New Min-Cut Max-Flow Ratio for Multicommodity Flows.- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.- Finding the Exact Integrality Gap for Small Traveling Salesman Problems.- Polynomial-Time Separation of Simple Comb Inequalities.- A New Approach to Cactus Construction Applied to TSP Support Graphs.- Split Closure and Intersection Cuts.- An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.- Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms.- On a Lemma of Scarf.- A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property.- Integer Programming and Arrovian Social Welfare Functions.- Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design.- The Minimum Latency Problem Is NP-Hard for Weighted Trees.- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.- A Polyhedral Approach to Surface Reconstruction from Planar Contours.- The Semidefinite Relaxation of the k-Partition Polytope Is Strong.- A Polyhedral Study of the Cardinality Constrained Knapsack Problem.- A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.- An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.- On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.- Hard Equality Constrained Integer Knapsacks.- The Distribution of Values in the Quadratic Assignment Problem.- A NewSubadditive Approach to Integer Programming.- Improved Approximation Algorithms for Resource Allocation.- Approximating the Advertisement Placement Problem.- Algorithms for Minimizing Response Time in Broadcast Scheduling.- Building Edge-Failure Resilient Networks.- The Demand Matching Problem.- The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.