×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings / Edition 1
     

Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings / Edition 1

by William J. Cook, Andreas S. Schulz
 

ISBN-10: 3540436766

ISBN-13: 9783540436768

Pub. Date: 06/20/2002

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, held in Cambridge, MA, USA, in May 2002.
The 33 revised full papers presented were carefully reviewed and selected from a total of 110 submissions. Among the topics covered are scaling algorithms, flow algorithms,

Overview

This book constitutes the refereed proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, held in Cambridge, MA, USA, in May 2002.
The 33 revised full papers presented were carefully reviewed and selected from a total of 110 submissions. Among the topics covered are scaling algorithms, flow algorithms, combinatorial optimization algorithms, approximate TSP solutions, graph computations, algorithmic geometry, mixed integer programming, network design, logistic scheduling, constraint solving, resource allocation, matching algorithms, and matroid intersection algorithms.

Product Details

ISBN-13:
9783540436768
Publisher:
Springer Berlin Heidelberg
Publication date:
06/20/2002
Series:
Lecture Notes in Computer Science Series , #2337
Edition description:
2002
Pages:
487
Product dimensions:
6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

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 New Subadditive 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.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews