Cargando…

Discrete optimization /

This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynom...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Parker, R. Gary
Otros Autores: Rardin, Ronald L.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boston : Academic Press, �1988.
Colección:Computer science and scientific computing.
Temas:
Acceso en línea:Texto completo
Descripción
Sumario:This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.
Descripción Física:1 online resource (xi, 472 pages) : illustrations
Bibliografía:Includes bibliographical references (pages 437-459) and index.
ISBN:0125450753
9780125450751
9781483294803
1483294803