Integer Programming and Combinatorial Optimization - neues Buch

EAN (ISBN-13): 9783540259602
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-05-10T03:50:21+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-10T19:24:09+01:00 (Zurich)
ISBN/EAN: 9783540259602

ISBN - alternative Schreibweisen:
978-3-540-25960-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: nemhauser
Titel des Buches: combinatorial optimization, integer programming

---

Daten vom Verlag:

Autor/in: George Nemhauser; Daniel Bienstock
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
Verlag: Springer; Springer Berlin
448 Seiten
Erscheinungsjahr: 2004-07-27
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 448 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Wahrscheinlichkeitsrechnung und Statistik; Verstehen; algorithms; approximation; combinatorial optimization; combinatorics; complexity; computational complexity; computational geometry; game theory; graph algorithms; integer programming; mathematical programming; network algorithms; optimization; programming; scheduling; algorithm analysis and problem complexity; C; Probability Theory; Applications of Mathematics; Theory of Computation; Numerical Analysis; Algorithms; Discrete Mathematics in Computer Science; Computer Science; Stochastik; Angewandte Mathematik; Theoretische Informatik; Numerische Mathematik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; BC

Session 1.- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.- Metric Inequalities and the Network Loading Problem.- Valid Inequalities Based on Simple Mixed-Integer Sets.- Session 2.- The Price of Anarchy when Costs Are Non-separable and Asymmetric.- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem.- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games.- Session 3.- A Robust Optimization Approach to Supply Chain Management.- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.- Scheduling an Industrial Production Facility.- Session 4.- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.- A TDI Description of Restricted 2-Matching Polytopes.- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.- Session 5.- Semi-continuous Cuts for Mixed-Integer Programming.- Combinatorial Benders’ Cuts.- A Faster Exact Separation Algorithm for Blossom Inequalities.- Session 6.- LP-based Approximation Algorithms for Capacitated Facility Location.- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem.- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.- Session 7.- Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions.- The Path-Packing Structure of Graphs.- More on a Binary-Encoded Coloring Formulation.- Session 8.- Single Machine Scheduling with Precedence Constraints.- The Constrained Minimum Weighted Sum of Job Completion Times Problem.- Session 9.- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption.- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.-All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.- Session 10.- A Capacity Scaling Algorithm for M-convex Submodular Flow.- Integer Concave Cocirculations and Honeycombs.- Minsquare Factors and Maxfix Covers of Graphs.- Session 11.- Low-Dimensional Faces of Random 0/1-Polytopes.- On Polyhedra Related to Even Factors.- Optimizing over Semimetric Polytopes.
Includes supplementary material: sn.pub/extras