Discrete Optimization
R. Gary Parker and Ronald L. Rardin (Auth.)
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
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
Anno:
1988
Casa editrice:
Elsevier Inc, Academic Press
Lingua:
english
Pagine:
472
ISBN 10:
0125450753
ISBN 13:
9780125450751
Collana:
Computer Science and Scientific Computing
File:
PDF, 20.53 MB
IPFS:
,
english, 1988
Amazon 
Barnes & Noble 
Bookshop.org 
Converti i file
Più risultati di ricerca
Altri vantaggi 
Termini più frequenti
Liste di libri correlati
