Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - Libros - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 21 de noviembre de 2001
En caso de que portada y título no coincidan, el título será el correcto

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

Precio
$ 55,99
sin IVA

Pedido desde almacén remoto

Entrega prevista 26 de jun. - 9 de jul.

Nuestros clientes opinan:

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores
Mejor valorado en Trustpilot
Añadir a tu lista de deseos de 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.

Medios de comunicación Libros     Paperback Book   (Libro con tapa blanda y lomo encolado)
Publicado 21 de noviembre de 2001
ISBN13 9783540428770
Editores Springer-Verlag Berlin and Heidelberg Gm
Páginas 310
Dimensiones 216 × 279 × 17 mm   ·   449 g
Lengua Alemán  
Editor Junger, Michael
Editor Naddef, Denis

Mas por M Junger

Mostrar todo

Mere med samme udgiver

Ver todo de M Junger ( Ej. Paperback Book )