🎉 Up to 70% Off Selected ItemsShop Sale
Combinatorial Optimization
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.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
computational complexity;linear programming;education majors;graph theory;abstract algebra;primitive roots;local search;theory class;advanced concepts;wait awhile;pleasant memories;odd times;classic text;liberal arts;polytopes;optimisation;np-complete;lemma;dijkstra;combinatorial;combinatorics;finiteness;computability;one-semester;bipartite;convex;integer;quadratic;partitions;heuristics;partitioning;optimization;algebraic;approximation;algorithms;arithmetic;geometric;theorem;labeling;generating;proofs;chap;duality;intersection;andrews;matching;mathematics;mathematical;spanning;dual;exercises;books on arithmetics;books on lemma;books on combinatorics;books on dualities;books on advanced concepts;books on classic texts;waiting awhile;books on optimisations;books on mathematics;books on computabilities;books on integers;books on proofs;books on chaps;books on linear programmings;books on intersections;books on odd times;books on partitions;books on convices;books on exercises;books on local searches;books on polytopes;books on labelings;books on computational complexities;books on heuristics;books on theory classes;books on abstract algebras;generate;books on graph theories;books on dijkstra;books on algorithms;books on andrews;books on education majors;books on optimizations;match;books on liberal arts;books on approximations$30.00
Combinatorial Optimization—
$30.00
Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
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.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
computational complexity;linear programming;education majors;graph theory;abstract algebra;primitive roots;local search;theory class;advanced concepts;wait awhile;pleasant memories;odd times;classic text;liberal arts;polytopes;optimisation;np-complete;lemma;dijkstra;combinatorial;combinatorics;finiteness;computability;one-semester;bipartite;convex;integer;quadratic;partitions;heuristics;partitioning;optimization;algebraic;approximation;algorithms;arithmetic;geometric;theorem;labeling;generating;proofs;chap;duality;intersection;andrews;matching;mathematics;mathematical;spanning;dual;exercises;books on arithmetics;books on lemma;books on combinatorics;books on dualities;books on advanced concepts;books on classic texts;waiting awhile;books on optimisations;books on mathematics;books on computabilities;books on integers;books on proofs;books on chaps;books on linear programmings;books on intersections;books on odd times;books on partitions;books on convices;books on exercises;books on local searches;books on polytopes;books on labelings;books on computational complexities;books on heuristics;books on theory classes;books on abstract algebras;generate;books on graph theories;books on dijkstra;books on algorithms;books on andrews;books on education majors;books on optimizations;match;books on liberal arts;books on approximations
