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

EAN (ISBN-13): 9783540422259
ISBN (ISBN-10): 3540422250
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2001
Herausgeber: Springer Berlin
440 Seiten
Gewicht: 0,661 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-10-01T04:47:20+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-09T16:24:19+01:00 (Zurich)
ISBN/EAN: 9783540422259

ISBN - alternative Schreibweisen:
3-540-42225-0, 978-3-540-42225-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: aardal
Titel des Buches: integer programming combinatorial optimization, netherlands, utrecht, international optimization, lecture notes computer science, proceedings the 8th international

---

Daten vom Verlag:

Autor/in: Karen Aardal; Bert Gerards
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings
Verlag: Springer; Springer Berlin
428 Seiten
Erscheinungsjahr: 2001-05-30
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 428 p.

BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Wahrscheinlichkeitsrechnung und Statistik; Verstehen; Approximation; Approximation Algorithms; Computational Complexity; Discrete Mathematics; Graph Algorithms; Integer Programming; Mathematical Programming; Network Algorithms; Scheduling Computational Geometry; Variable; algorithms; combinatorial optimization; complexity; optimization; programming; algorithm analysis and problem complexity; combinatorics; Probability Theory; Algorithms; Discrete Mathematics in Computer Science; IT in Business; Discrete Mathematics; Stochastik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Wirtschaftsmathematik und -informatik, IT-Management; Unternehmensanwendungen; EA

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 withMinsum 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.
Includes supplementary material: sn.pub/extras