Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Książki - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21 listopada 2001
W przypadku, gdy okładka i tytuł się nie zgadzają, tytuł jest poprawny

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

Cena
zł 217,90

Zamówione z odległego magazynu

Przewidywana dostawa 10 - 18 wrz
Otrzymuj powiadomienia o nowych wydawnictwach M Junger

Nasi klienci mówią:

14-dniowa polityka zwrotów zgodnie z europejskim prawem ochrony konsumentów
Najwyższa ocena na Trustpilot
Dodaj do swojej listy życzeń iMusic

Jeszcze nie oceniono

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.

Media Książki     Paperback Book   (Książka z miękką okładką i klejonym grzbietem)
Wydane 21 listopada 2001
ISBN13 9783540428770
Wydawcy Springer-Verlag Berlin and Heidelberg Gm
Strony 310
Wymiary 216 × 279 × 17 mm   ·   449 g
Język Niemiecki  
Redaktor Junger, Michael
Redaktor Naddef, Denis

Więcej od M Junger

Pokaż wszystko

Więcej od tego samego wydawcy

Zobacz wszystko od M Junger ( np. Paperback Book )