Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Boeken - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21 november 2001
Indien omslag en titel niet overeenkomen, is de titel correct

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

Prijs
€ 50,99

Besteld in een afgelegen magazijn

Verwachte levering 16 - 24 jun.

Onze klanten zeggen:

14 dagen retourrecht in overeenstemming met de Europese consumentenbeschermingswetgeving
Topnotering op Trustpilot
Voeg toe aan uw iMusic-verlanglijst

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 Boeken     Paperback Book   (Boek met zachte kaft en gelijmde rug)
Vrijgegeven 21 november 2001
ISBN13 9783540428770
Uitgevers Springer-Verlag Berlin and Heidelberg Gm
Pagina's 310
Afmetingen 216 × 279 × 17 mm   ·   449 g
Taal en grammatica Duits  
Uitgever Junger, Michael
Uitgever Naddef, Denis

Meer door M Junger

Alles tonen

Mere med samme udgiver

Bekijk alles van M Junger ( bijv. Paperback Book )