Verwandte Artikel zu Programming in Networks and Graphs: On The Combinatorial...
Programming in Networks and Graphs: On The Combinatorial Background And Near-Equivalence Of Network Flow And Matching Algorithms: 300 (Lecture Notes in Economics and Mathematical Systems) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Programming in Networks and Graphs: On The Combinatorial...
Foto des Verkäufers
Programming in networks and graphs Lecture notes in economics and mathematical systems ; Vol. 300
ISBN 10: 3540189696
ISBN 13: 9783540189695
Gebraucht
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
(Berlin. XI, 315 S. : graph. Darst. ; 25 cm Ehem. Bibliotheksexemplar in GUTEM Zustand, wenige Gebrauchsspuren. Ex-library in GOOD condition, few traces of use. Sa 796 3540189696 Sprache: Deutsch Gewicht in Gramm: 550. Bestandsnummer des Verkäufers 2072690
Anzahl: 1 verfügbar
Foto des Verkäufers
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, Vol. 300;
ISBN 10: 3540189696
ISBN 13: 9783540189695
Gebraucht
Broschiert;
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Broschiert; Zustand: Gut. XI, 315 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 540. Bestandsnummer des Verkäufers 1699200
Anzahl: 1 verfügbar
Foto des Verkäufers
Programming in Networks and Graphs. On the Combinatorial Background and Near-Equivalence of Networt Flow and Matching Algorithms.
Verlag:
Springer Berlin, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Gebraucht
Paperback/ broschiert
Anbieter: ralfs-buecherkiste, Herzfelde, MOL, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Paperback/ broschiert. Zustand: Gut. 315 S. Ökonomie (=Lecture Notes in Economics and Mathematical Systems, Vol. 300). Guter Zustand/ Good Ex-Library. Papier leicht angegilbt. ha1064009 Sprache: Englisch Gewicht in Gramm: 600. Bestandsnummer des Verkäufers 292167
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Verlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Gebraucht
Softcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: Très bon. Légères traces d'usure sur la couverture. Salissures sur la tranche. Couverture différente. Edition 1988. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Slight signs of wear on the cover. Stains on the edge. Different cover. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers E-591-001
Anzahl: 1 verfügbar
Foto des Verkäufers
Programming in Networks and Graphs
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Bestandsnummer des Verkäufers 4883974
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Programming in Networks and Graphs
ISBN 10: 3540189696
ISBN 13: 9783540189695
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 328 pp. Englisch. Bestandsnummer des Verkäufers 9783540189695
Anzahl: 1 verfügbar
Foto des Verkäufers
Programming in Networks and Graphs : On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540189695
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
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)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540189695_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Programming in Networks and Graphs
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 328. Bestandsnummer des Verkäufers 1897859510
Anzahl: 4 verfügbar
Foto des Verkäufers
Programming in Networks and Graphs
Verlag:
Springer Berlin Heidelberg Apr 1988, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 328 pp. Englisch. Bestandsnummer des Verkäufers 9783540189695
Anzahl: 2 verfügbar