Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21. novembra 2001
Če se naslovnica in naslov ne ujemata, je naslov pravilen

M Junger
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science 2001 edition

Cena
€ 50,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 16. - 24. jun

Kaj pravijo naše stranke:

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov
Najvišja ocena na Trustpilot
Dodaj na svoj seznam želja iMusic

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches.

Marc Notes: Includes bibliographical references and index. Table of Contents: General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.- Projection and Lifting in Combinatorial Optimization.- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems.- Lagrangian Relaxation.- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.- Branch, Cut, and Price: Sequential and Parallel.- TSP Cuts Which Do Not Conform to the Template Paradigm. Publisher Marketing: This tutorial contains written versions of seven lectures on computational combinatorial optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modelling are extensively discussed. Applications to prominent combinatorial optimization problems such as production and transport planning, are treated in many places in particular, the book contains an account of the most successful techniques for solving the travelling salesman problem to optimality.

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 21. novembra 2001
ISBN13 9783540428770
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 310
Dimenzije 216 × 279 × 17 mm   ·   449 g
Jezik Nemščina  
Urednik Junger, Michael
Urednik Naddef, Denis

Več od M Junger

Prikaži vse

Mere med samme udgiver

Ogled vseh M Junger ( Na primer Paperback Book )