Combinatorial Optimization

Front Cover
Alpha Science Int'l Ltd., 2004 - Mathematics - 225 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Minimal Spanning Trees in Probability
1
Discrete Optimizaton Problems in the Design of
21
MinMax Problems on Graphs and Communication Networks
65
Semigraphs
125
The Poly tope of Degree Sequences of Hypergraphs
139
Extensions of KonigEgervary Theorem to Matrioids and Bimatroids
207
Copyright

Common terms and phrases

Bibliographic information