Combinatorial Optimization
Algorithms and Complexity
Published on 1. February 2000
Book
Paperback/Softback
528 pages
978-0-486-40258-1 (ISBN)
Description
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 1982 edition.
More details
Language
English
Place of publication
United States
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 216 mm
Width: 140 mm
Thickness: 27 mm
Weight
625 gr
ISBN-13
978-0-486-40258-1 (9780486402581)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification