Wyniki wyszukiwania:

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...

An insight into the latest results from the world of operations research - a wide-ranging field, as is shown by the book's 24 sections, corresponding to the conference program itself. Although problems of a primarily methodological nature are discussed, the emphasis is placed firmly on practical subjects, such as reports from the fields of healthcare, environmental protection, logistics and traffic engineering. This selection also clearly illustrates the extent to which OR is spreading into and already interwoven in other scientific disciplines.