Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

ISBN 10: 3662175622 / ISBN 13: 9783662175620

Published by Springer, 2014

About this Item

In.

Seller Inventory # ria9783662175620_new

Bibliographic Details

• Title: Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings
• Publisher: Springer
• Publication Date: 2014
• Language: English
• ISBN 10: 3662175622
• ISBN 13: 9783662175620
• Binding: Soft cover
• Condition: New

About this title

Synopsis

Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem.- Strongly Polynomial Algorithms for the Unsplittable Flow Problem.- Edge Covers of Setpairs and the Iterative Rounding Method.- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates.- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.- On the Rank of Mixed 0,1 Polyhedra.- Fast 2-Variable Integer Programming.- Approximating k-Spanner Problems for k > 2.- A Matroid Generalization of the Stable Matching Polytope.- A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.- Combined Connectivity Augmentation and Orientation Problems.- An Extension of a Theorem of Henneberg and Laman.- Bisubmodular Function Minimization.- On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem.- Circuit Mengerian Directed Graphs.- Integral Polyhedra Related to Even Cycle and Even Cut Matroids.- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.- Synthesis of 2-Commodity Flow Networks.- Bounds for Deterministic Periodic Routing sequences.- Cutting Planes for Mixed 0-1 Semidefinite Programs.- Independence Free Graphs and Vertex connectivity Augmentation.- The Throughput of Sequential Testing.- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.- Pruning by Isomorphism in Branch-and-Cut.- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.- Fences Are Futile: On Relaxations for the Linear Ordering Problem.- Generating Cuts from Multiple-Term Disjunctions.- A (2+?)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.- Performance Guarantees of Local Search for Multiprocessor Scheduling.- connected Joins in Graphs.- Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.- Approximation Algorithms for the Minimum Bends Traveling Salesman Problem.