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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Aardal, Karen (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Gerards, Bert (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2081
• Θέματα: Probabilities.; Algorithms.; Computer science-Mathematics.; Information technology.; Business-Data processing.; Combinatorics.; Probability Theory and Stochastic Processes.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; IT in Business.

This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- t...

Πίνακας περιεχομένων:

• 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.