This is an attempt to present some complex problems of discrete mathematics in a simple and unified form using a unique, general combinatorial scheme. The autho

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some

A 1996 account of some complex problems of discrete mathematics in a simple and unified form.

Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary background, in

For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental dire