Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings (Theoretical Computer Science and General Issues, 3509, Band 3509) - Taschenbuch

EAN (ISBN-13): 9783540261995
ISBN (ISBN-10): 3540261990
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer
504 Seiten
Gewicht: 0,754 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-21T07:14:44+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-10T21:16:53+01:00 (Zurich)
ISBN/EAN: 9783540261995

ISBN - alternative Schreibweisen:
3-540-26199-0, 978-3-540-26199-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: jünger, junger michael, springer, nger, juenger, volker jung, völker michael, kaibel, large
Titel des Buches: integer programming combinatorial optimization, theoretical computer science, notes berlin, international optimization, com programming, germany, berlin 2005, international conference proceedings, lecture notes computer science, june june

---

Daten vom Verlag:

Autor/in: Michael Jünger; Volker Kaibel
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Integer Programming and Combinatorial Optimization - 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Verlag: Springer; Springer Berlin
488 Seiten
Erscheinungsjahr: 2005-06-01
Berlin; Heidelberg; DE
Gewicht: 1,540 kg
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XII, 488 p.

BC; Discrete Mathematics in Computer Science; Hardcover, Softcover / Informatik, EDV/Informatik; Mathematik für Informatiker; Verstehen; algorithm; algorithmics; algorithms; approximation algorithms; calculus; combinatorial optimization; combinatorics; computational complexity; computational discrete Mathematics; computational geometry; graph computations; integer programming; network algorithms; optimization; programming; algorithm analysis and problem complexity; Numeric Computing; Algorithm Analysis and Problem Complexity; Computer Graphics; Discrete Mathematics in Computer Science; Numerical Analysis; Algorithms; Computer Graphics; Diskrete Mathematik; Numerische Mathematik; Algorithmen und Datenstrukturen; Grafikprogrammierung; EA

Mixed-Integer Cuts from Cyclic Groups.- Optimizing over the First Chvàtal Closure.- Sequential Pairing of Mixed Integer Inequalities.- Approximate Min-max Relations for Odd Cycles in Planar Graphs.- Disjoint Cycles: Integrality Gap, Hardness, and Approximation.- A Combinatorial Algorithm to Find a Maximum Even Factor.- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.- Inventory and Facility Location Models with Market Selection.- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations.- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.- On the Inefficiency of Equilibria in Congestion Games.- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.- LP-Based Online Scheduling: From Single to Parallel Machines.- Unique Sink Orientations of Grids.- Jumping Doesn’t Help in Abstract Cubes.- Computing the Inertia from Sign Patterns.- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.- Smoothed Analysis of Integer Programming.- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.- Approximation Algorithms for Stochastic Inventory Control Models.- On Two-Stage Stochastic Minimum Spanning Trees.- Combinatorial Analysis of Generic Matrix Pencils.- Power Optimization for Connectivity Problems.- Packing Steiner Forests.- Bidimensional Packing by Bilinear Programming.- On the L ???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs.- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks.- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem.- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.- A Study of Domino-Parity and k-Parity Constraints for the TSP.- Not Every GTSP Facet Induces an STSP Facet.