Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.We run the MOORE-BELLMAN-FORD ALGORITHM on this instance and obtain numbers l(v) for all v a V(G). ... Otherwise let (v, w) be any edge with l(w) agt; l(v) + c ((v, w)). ... PROBLEM. Instance: A digraph G and conservative weights c : E(G) a R. Task: Find numbers lst and vertices pst for all s, t a V(G) with s = t, such that lst anbsp;...
|Author||:||Bernhard Korte, Jens Vygen|
|Publisher||:||Springer Science & Business Media - 2007-11-04|