|
By Subject > Science and Mathematics > Mathematics > Combinatorial Optimization
Recommendations...
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This 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; local search heuristics for NP-complete problems, more. 1982 edition.
all books in Combinatorial Optimization
|  |
|  | Combinatorial Algorithms: Enlarged Second Edition by T. C. Hu, M. T. Shing This updated edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. Includes 153 black-and-white illustrations and 23 tables.
all books in Combinatorial Optimization
|  |
|
Combinatorial Enumeration by Ian P. Goulden, David M. Jackson Graduate-level text presents mathematical theory and problem-solving techniques associated with enumeration problems, from elementary to research level, for discrete structures and their substructures. Full solutions to 350 exercises.
all books in Combinatorial Optimization
|  |
|  | Foundations of Combinatorics with Applications by Edward A. Bender, S. Gill Williamson Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
all books in Combinatorial Optimization
|  |
|
Introduction to Combinatorial Analysis by John Riordan Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation. Includes problems. 1958 edition.
all books in Combinatorial Optimization
|  |
|  | |
Combinatory Analysis by Percy A. MacMahon Account of combinatory analysis theorems shows their connections and unites them as parts of a general doctrine. Topics include symmetric functions, theory of number compositions, more. 1915, 1916, and 1920 editions.
all books in Combinatorial Optimization
|  |
|  | A Short Course in Discrete Mathematics by Edward A. Bender, S. Gill Williamson Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
all books in Combinatorial Optimization
|  |
|
| Products in Combinatorial Optimization |  |  |  | Combinatorial Algorithms: Enlarged Second Edition by T. C. Hu, M. T. Shing This updated edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. Includes 153 black-and-white illustrations and 23 tables.
|
|  | Combinatorial Enumeration by Ian P. Goulden, David M. Jackson Graduate-level text presents mathematical theory and problem-solving techniques associated with enumeration problems, from elementary to research level, for discrete structures and their substructures. Full solutions to 350 exercises.
|
|  | Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This 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; local search heuristics for NP-complete problems, more. 1982 edition.
|
|  | Combinatorics for Computer Science by S. Gill Williamson Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with each part divided into a "basic concepts" chapter, followed by 4 "topics" chapters that explore ideas in depth. Includes 219 figures.
|
|  | Combinatory Analysis by Percy A. MacMahon Account of combinatory analysis theorems shows their connections and unites them as parts of a general doctrine. Topics include symmetric functions, theory of number compositions, more. 1915, 1916, and 1920 editions.
|
|  | Discrete Optimization Algorithms: with Pascal Programs by Maciej M. Syslo, Narsingh Deo, Janusz S. Kowalik Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
|
|  | Foundations of Combinatorics with Applications by Edward A. Bender, S. Gill Williamson Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
|
|  | Introduction to Combinatorial Analysis by John Riordan Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation. Includes problems. 1958 edition.
|
|  | An Introduction to the Approximation of Functions by Theodore J. Rivlin This text provides an introduction to methods of approximating continuous functions by functions that depend only on a finite number of parameters — an important technique in the field of digital computation. 1969 edition.
|
|  | A Short Course in Discrete Mathematics by Edward A. Bender, S. Gill Williamson Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
|
|
|
 |