Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - November 21, 2001
In case cover and title do not match, the title is correct

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

Price
R 915
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 12 - 18

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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 Books     Paperback Book   (Book with soft cover and glued back)
Released November 21, 2001
ISBN13 9783540428770
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 310
Dimensions 216 × 279 × 17 mm   ·   449 g
Language German  
Editor Junger, Michael
Editor Naddef, Denis

More by M Junger

Show all

Mere med samme udgiver

See all of M Junger ( e.g. Paperback Book )