Combinatorial Optimization is the process of finding one or more best (optimal) solutions in a well defined discrete problem space. Such problems occur in almost all fields of management as well as in many engineering disciplines. Many businesses and industries use techniques of discrete optimization to improve the efficiency of their operations. The development of new optimization tools, algorithms and new applications of combinatorial optimization to problems arising in industry and business have been provided. The book also contains complete but concise proofs for several deep results. Many references are given at the end of each topic.

• • Matroids • Bimatroids • Polytope of Degree Sequences • Submodular Functions

Preface / List of Contributors / Minimal Spanning Trees in Probability / Discrete Optimization Problems in the Design of interconnection Networks / Min-Max Problems on Graphs and Communications Networks / Semigraphs / The Polytope of Degree Sequences of Hypergraphs / Submodular Functions, Convolution and Dilworth Truncation / Extensions of Konig-Egervary theorem to Matroids and Bimatroids

Teachers & Researchers in Mathematics / Engineering