| 书目名称 | Programming in Networks and Graphs |
| 副标题 | On the Combinatorial |
| 编辑 | Ulrich Derigs |
| 视频video | |
| 丛书名称 | Lecture Notes in Economics and Mathematical Systems |
| 图书封面 |  |
| 描述 | 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 algorith |
| 出版日期 | Book 1988 |
| 关键词 | algorithms; combinatorial optimization; efficiency; linear optimization; optimization |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-51713-6 |
| isbn_softcover | 978-3-540-18969-5 |
| isbn_ebook | 978-3-642-51713-6Series ISSN 0075-8442 Series E-ISSN 2196-9957 |
| issn_series | 0075-8442 |
| copyright | Springer-Verlag Berlin Heidelberg 1988 |
发表于 2025-3-21 18:23:34
