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
Autores principales: Parker, R Gary, Rardin, Ronald L
Lenguaje:eng
Publicado: Academic Press 1988
Materias:
Acceso en línea:http://cds.cern.ch/record/1985907
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.Several appendixes are included which review the fundamental ideas o