Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Livros - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21 de novembro de 2001
Caso a capa e o título não sejam correspondentes, considere o título como correto

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

Preço
€ 50,99

Item sob encomenda (no estoque do fornecedor)

Data prevista de entrega 16 - 24 de jun

O que dizem nossos clientes:

Política de devolução de 14 dias, em conformidade com a lei europeia de proteção do consumidor
Melhor classificação na Trustpilot
Adicione à sua lista de desejos do 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ídia Livros     Paperback Book   (Livro de capa flexível e brochura)
Lançado 21 de novembro de 2001
ISBN13 9783540428770
Editoras Springer-Verlag Berlin and Heidelberg Gm
Páginas 310
Dimensões 216 × 279 × 17 mm   ·   449 g
Idioma Alemão  
Editor Junger, Michael
Editor Naddef, Denis

Mais por M Junger

Mostrar tudo

Mere med samme udgiver

Ver tudo de M Junger ( por exemplo Paperback Book )