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
Table of Contents:
  • Machine derived contents note: Table of contents for Discrete optimization / R. Gary Parker, Ronald L. Rardin.
  • Bibliographic record and links to related information available from the Library of Congress catalog
  • Information from electronic data provided by the publisher. May be incomplete or contain other coding.
  • Introduction to Discrete Optimization. Computational Complexity. Polynomial Algorithms-Matroids Enumeration Algorithms. Polynomial Algorithms. Linear Programming Nonpolynomial algorithims-Partial Enumeration Nonpolynomial Algorithims-Polyhedral Description Nonexact Algorithms Vector Matrices and Convex Sets Graph Theory Fundamentals Linear Programming Fundamentals.
  • Library of Congress subject headings for this publication: Mathematical optimization.

Similar Items