Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Livres - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21 novembre 2001
Si la couverture et le titre ne correspondent pas, le titre est correct.

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

Prix
€ 50,99

Commandé depuis un entrepôt distant

Livraison prévue 8 - 16 juil.

Nos clients disent :

Politique de retour de 14 jours conformément à la loi européenne sur la protection des consommateurs
Meilleur classement sur Trustpilot
Ajouter à votre liste de souhaits 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édias Livres     Paperback Book   (Livre avec couverture souple et dos collé)
Validé 21 novembre 2001
ISBN13 9783540428770
Éditeurs Springer-Verlag Berlin and Heidelberg Gm
Pages 310
Dimensions 216 × 279 × 17 mm   ·   449 g
Langue et grammaire Allemand  
Éditeur Junger, Michael
Éditeur Naddef, Denis

Plus par M Junger

Afficher tout

Mere med samme udgiver

Voir tous les M Junger ( par ex. Paperback Book )