Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Knihy - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21. novembra 2001
V prípade, že obal a názov nesedia, platí názov

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

Cena
€ 52,99

Objednané zo vzdialeného skladu

Očakávané doručenie 16. - 24. jún

Naši zákazníci hovoria:

14-dňová lehota na vrátenie podľa európskej legislatívy o ochrane spotrebiteľa
Najvyššie hodnotenie na Trustpilot
Pridať do vášho zoznamu prianí na 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.

Médium Knihy     Paperback Book   (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané 21. novembra 2001
ISBN13 9783540428770
Vydavatelia Springer-Verlag Berlin and Heidelberg Gm
Strany 310
Rozmery 216 × 279 × 17 mm   ·   449 g
Jazyk Nemčina  
Editor Junger, Michael
Editor Naddef, Denis

Viac od M Junger

Zobraziť všetko

Mere med samme udgiver

Pozrieť všetko od M Junger ( napr. Paperback Book )