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...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Parker, R. Gary
Other Authors: Rardin, Ronald L.
Format: Electronic eBook
Language:Inglés
Published: Boston : Academic Press, �1988.
Series:Computer science and scientific computing.
Subjects:
Mathematical optimization.
Electronic books.
Optimisation math�ematique.
Livres num�eriques.
e-books.
MATHEMATICS > General.
Mathematical optimization
Optimaliseren.
Combinatieleer.
Combinatorial mathematics
Online Access:Texto completo
Description
Summary: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.
Physical Description:1 online resource (xi, 472 pages) : illustrations
Bibliography:Includes bibliographical references (pages 437-459) and index.
ISBN:0125450753
9780125450751
9781483294803
1483294803

Similar Items