This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
Autores populares
Icon Group International (283) Publishing lmgdaw (250) Nikolay Krechet (145) Kennie B Journals (120) Charles Nehme (106) Riddler Books (105) webmarbook design (103) Mint and Cherry Notebooks (82) Jillo Trukudo (80) Ondrej Sarek (76) Iwona Makara (74) Just Visualize It (71) Moonpeak Library (69) Quick Witted Coconut (69) Mary Hirose (67) Talor Press (67) Various (67) Marina Buchholz B.Eng (58) Miller Sye (58) NAK Legal Publishing (58)