|
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.
|  |
| |  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.
| |
|
 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.
| |
|
 Companion to Concrete Mathematics
by Z. A. Melzak
A two-volume treatment in a single binding, this supplementary text stresses intuitive appeal and ingenuity. It employs physical analogies, encourages problem formulation, and supplies problem-solving methods. 1973 and 1976 editions.
| |
| |  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.
| |
|
|
Products 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.
|
| | 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.
|
|  | Combinatorial Optimization: Networks and Matroids
by Eugene Lawler
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
|
|  | 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.
|
|  | An Introduction to the Approximation of Functions
by Theodore J. Rivlin
Graduate-level text offers a concise, wide-ranging introduction to methods of approximating continuous functions by functions depending only on a finite number of parameters. Particular emphasis on approximation by polynomials. 1969 edition.
|
|  | Matroid Theory
by D. J. A. Welsh
Text by a noted expert describes standard examples and investigation results, using elementary proofs to develop basic matroid properties before advancing to a more sophisticated treatment. Includes numerous exercises. 1976 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.
|
|  | Sieve Methods
by Heine Halberstam, Hans Egon Richert
This text by a noted pair of experts is regarded as the definitive work on sieve methods. It formulates the general sieve problem, explores the theoretical background, and illustrates significant applications. 1974 edition.
|
|
|
|
|
|
|
|