Integer Programming and Combinatorial Optimization 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings - Taschenbuch

EAN (ISBN-13): 9783540613107
ISBN (ISBN-10): 3540613102
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1996
Herausgeber: Springer Berlin Heidelberg
505 Seiten
Gewicht: 0,783 kg

Buch in der Datenbank seit 2007-10-25T19:46:25+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-13T14:05:51+01:00 (Zurich)
ISBN/EAN: 9783540613107

ISBN - alternative Schreibweisen:
3-540-61310-2, 978-3-540-61310-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: cunningham, mccormick, william thomas, maurice william
Titel des Buches: integer programming combinatorial optimization, canada, computer notes, june, british combinatorial conference, international optimization, vancouver, mccormick, 1996

---

Daten vom Verlag:

Autor/in: William H. Cunningham; S. Thomas McCormick; Maurice Queyranne
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings
Verlag: Springer; Springer Berlin
514 Seiten
Erscheinungsjahr: 1996-05-15
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 514 p. 18 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Ganzzahliges Programmieren; Handlungsreisendenproblem (TSP); Kombiatorische Algorithmen; Kombinatorische Optimierung; algorithms; combinatorial algorithms; combinatorial optimization; integer programming; programming; scheduling; traveling salesman problem (TSP); algorithm analysis and problem complexity; combinatorics; Theory of Computation; Probability Theory; Software Engineering; Algorithms; Calculus of Variations and Optimization; Discrete Mathematics; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Software Engineering; Algorithmen und Datenstrukturen; Optimierung; Diskrete Mathematik; EA

Colourful linear programming.- Test sets and inequalities for integer programs.- An optimal, stable continued fraction algorithm for arbitrary dimension.- Algorithms and extended formulations for one and two facility network design.- Integer multicommodity flow problems.- A heuristic algorithm for the set covering problem.- An ?-Relaxation method for generalized separable convex cost network flow problems.- Finding real-valued single-source shortest paths in o(n 3) expected time.- A network-flow technique for finding low-weight bounded-degree spanning trees.- Approximating k-set cover and complementary graph coloring.- On minimum 3-cuts and approximating k-cuts using Cut Trees.- Primal-dual approximation algorithms for feedback problems in planar graphs.- Cone-LP's and semidefinite programs: Geometry and a simplex-type method.- Quadratic knapsack relaxations using cutting planes and semidefinite programming.- A semidefinite bound for mixing rates of Markov chains.- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases.- On optimizing multiplications of sparse matrices.- Continuous relaxations for Constrained Maximum-Entropy Sampling.- A submodular optimization problem with side constraints.- Convexity and Steinitz's exchange property.- On ideal clutters, metrics and multiflows.- A supermodular relaxation for scheduling with release dates.- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds.- Implementation of a linear time algorithm for certain generalized traveling salesman problems.- On dependent randomized rounding algorithms.- Coloring bipartite hypergraphs.- Improved randomized approximation algorithms for lot-sizing problems.- Minimizingtotal completion time in a two-machine flowshop: Analysis of special cases.- A new approach to computing optimal schedules for the job-shop scheduling problem.- Optimal on-line algorithms for single-machine scheduling.- The strongest facets of the acyclic subgraph polytope are unknown.- Transitive packing.- A polyhedral approach to the feedback vertex set problem.- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time.- Separating maximally violated comb inequalities in planar graphs.- The travelling salesman and the PQ-tree.