Idioma: Inglés
Publicado por Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo : Springer, 1988
ISBN 10: 3540189696 ISBN 13: 9783540189695
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
EUR 19,80
Cantidad disponible: 1 disponibles
Añadir al carritoBroschiert; Condición: Gut. XI, 315 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 540.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,89
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 74,24
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 59,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 79,10
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 1st edition. 328 pages. 9.00x5.90x0.74 inches. In Stock.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Librería: preigu, Osnabrück, Alemania
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Programming in Networks and Graphs | On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms | Ulrich Derigs | Taschenbuch | Lecture Notes in Economics and Mathematical Systems | xi | Englisch | 1988 | Springer | EAN 9783540189695 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 109,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 100,07
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 130,50
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 214,43
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Very Good. Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.