Artículos relacionados a Discrete Optimization (Computer Science and Scientific...

Discrete Optimization (Computer Science and Scientific Computing) - Tapa dura

Parker, R. Gary; Rardin, Ronald L.

 
9780125450751: Discrete Optimization (Computer Science and Scientific Computing)
Tapa dura
ISBN 10: 0125450753 ISBN 13: 9780125450751
Editorial: Academic Press Inc, 1988

Sinopsis

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 of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

Accessible to students, researchers, and instructors, this work would be valuable both for a university course in discrete optimization and as a reference book. The references are good and up to date.--COMPUTING REVIEWSThe book is cleary and beautifully written. It is a very useful reference on the subject and can be used as an advanced graduate text for courses in combinatorial or discrete optimization.--MATHEMATICAL REVIEWS

Reseña del editor

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 of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Academic Press Inc
Año de publicación
1988
Idioma
Inglés
ISBN 10 
0125450753
ISBN 13 
9780125450751
Encuadernación
Tapa dura
Número de páginas
472
Contacto del fabricante
no disponible
Persona responsable
Yeepin GmbH
492000000000
sunshine12232@outlook.com

Alleestr.11
Kaiserslautern
Rheinland-Pfalz
67655
Alemania