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
_version_ 1780945413697699840
author Parker, R Gary
Rardin, Ronald L
author_facet Parker, R Gary
Rardin, Ronald L
author_sort Parker, R Gary
collection CERN
description 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
id cern-1985907
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1988
publisher Academic Press
record_format invenio
spelling cern-19859072021-04-21T20:36:35Zhttp://cds.cern.ch/record/1985907engParker, R GaryRardin, Ronald LDiscrete optimizationMathematical Physics and MathematicsThis 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 oAcademic Pressoai:cds.cern.ch:19859071988
spellingShingle Mathematical Physics and Mathematics
Parker, R Gary
Rardin, Ronald L
Discrete optimization
title Discrete optimization
title_full Discrete optimization
title_fullStr Discrete optimization
title_full_unstemmed Discrete optimization
title_short Discrete optimization
title_sort discrete optimization
topic Mathematical Physics and Mathematics
url http://cds.cern.ch/record/1985907
work_keys_str_mv AT parkerrgary discreteoptimization
AT rardinronaldl discreteoptimization