Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Bøger - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21. november 2001
Ved uoverensstemmelse mellem cover og titel gælder titel

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

Pris
DKK 449

Bestilles fra fjernlager

Forventes klar til forsendelse 8. - 14. sep.
Modtag notifikation om nye M Junger udgivelser

Vores kunder siger:

14 dages fuld returret
Topvurdering på Trustpilot
Tilføj til din iMusic ønskeseddel
eller

Ikke bedømt endnu

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.

Medie Bøger     Paperback Bog   (Bog med blødt omslag og limet ryg)
Udgivet 21. november 2001
ISBN13 9783540428770
Forlag Springer-Verlag Berlin and Heidelberg Gm
Antal sider 310
Mål 216 × 279 × 17 mm   ·   449 g
Sprog Tysk  
Klipper/redaktør Junger, Michael
Klipper/redaktør Naddef, Denis

Mere med M Junger

Vis alle

Mere med samme udgiver

Se alt med M Junger ( f.eks. Paperback Bog )