Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms - Lecture Notes in Economics and Mathematical Systems 300 (Paperback)
  • Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms - Lecture Notes in Economics and Mathematical Systems 300 (Paperback)
zoom

Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms - Lecture Notes in Economics and Mathematical Systems 300 (Paperback)

(author)
£76.50
Paperback 315 Pages / Published: 13/04/1988
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a common combinatorial principle which might be inherent in all those apparently different approaches. It is shown that all common network flow and matching algorithms implicitly follow the so-called shortest augmenting path. This can be interpreted as a greedy-like decision rule where the optimal solution is built up through a sequence of local optimal solutions. The efficiency of this approach is realized by combining this myopic decision rule with an anticipant organization. The approach of this work is organized as follows. For several standard flow and matching problems the common solution procedures are first reviewed. It is then shown that they all reduce to a common basic principle, that is, they all perform the same computational steps if certain conditions are set properly and ties are broken according to a common rule. Recognizing this near-equivalence of all commonly used algorithms the question of the best method has to be modified - all methods are (only) different implementations of the same algorithm obtained by different views of the problem.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783540189695
Number of pages: 315
Weight: 545 g
Dimensions: 229 x 152 x 18 mm

You may also be interested in...

Basic Mathematics for Economists
Added to basket
The Dark Side of Management
Added to basket
Simulation
Added to basket
£49.99
Paperback
Competing Against Time
Added to basket
Risk and Asset Allocation
Added to basket
Credit and Collateral
Added to basket
£35.99
Paperback

Please sign in to write a review

Your review has been submitted successfully.