Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings (Lecture Notes in Computer Science, 1610, Band 1610) - Taschenbuch

EAN (ISBN-13): 9783540660194
ISBN (ISBN-10): 3540660194
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1999
Herausgeber: Springer
472 Seiten
Gewicht: 0,707 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-29T04:11:33+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-10T19:24:08+01:00 (Zurich)
ISBN/EAN: 9783540660194

ISBN - alternative Schreibweisen:
3-540-66019-4, 978-3-540-66019-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: rainer burkard, rainer gerhard, cornu, rainer during, gerhard see, wöginger, gerard, rainer held
Titel des Buches: proceedings international conference, integer programming combinatorial optimization, graz, din 1610, who who austria, 7th international, lecture notes computer science

---

Daten vom Verlag:

Autor/in: Gerard Cornuejols; Rainer E. Burkard; Gerhard J. Woeginger
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings
Verlag: Springer; Springer Berlin
462 Seiten
Erscheinungsjahr: 1999-05-19
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 462 p.

BC; Hardcover, Softcover / Mathematik/Sonstiges; Diskrete Mathematik; Verstehen; Graph; algorithms; combinatorial optimization; combinatorics; complexity; computational geometry; optimization; programming; scheduling; algorithm analysis and problem complexity; Discrete Mathematics; Probability Theory; Programming Techniques; Algorithms; Discrete Mathematics in Computer Science; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Mathematik für Informatiker; EA

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.- Solving the Convex Cost Integer Dual Network Flow Problem.- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.- Valid Inequalities for Problems with Additive Variable Upper Bounds.- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version).- On the Separation of Maximally Violated mod-k Cuts.- Improved Approximation Algorithms for Capacitated Facility Location Problems.- Optimal 3-Terminal Cuts and Linear Programming.- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.- Universally Maximum Flow with Piecewise-Constant Capacities.- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope.- An Orientation Theorem with Parity Conditions.- Parity Constrained k-Edge-Connected Orientations.- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.- On the Chvátal Rank of Certain Inequalities.- The Square-Free 2-Factor Problem in Bipartite Graphs.- The m-Cost ATSP.- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.- Edge-Splitting Problems with Demands.- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors.- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract).- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.- Approximation Algorithms for a Directed Network Design Problem.- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract).- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.- Scheduling Two Machines with Release Times.- An Introduction to Empty Lattice Simplices.- On Optimal Ear-Decompositions of Graphs.- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract).- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.