Articles liés à 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 - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Programming in Networks and Graphs: On The Combinatorial...
Image fournie par le vendeur
Programming in networks and graphs Lecture notes in economics and mathematical systems ; Vol. 300
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Ancien ou d'occasion
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
(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. N° de réf. du vendeur 2072690
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
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
Ancien ou d'occasion
Broschiert;
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Broschiert; Etat : Gut. XI, 315 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 540. N° de réf. du vendeur 1699200
Quantité disponible : 1 disponible(s)
Image d'archives
Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Edité par
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Ancien ou d'occasion
Softcover
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Softcover. Etat : 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. N° de réf. du vendeur E-591-001
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Programming in Networks and Graphs. On the Combinatorial Background and Near-Equivalence of Networt Flow and Matching Algorithms.
Edité par
Springer Berlin, 1988
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Ancien ou d'occasion
Paperback/ broschiert
Vendeur : ralfs-buecherkiste, Herzfelde, MOL, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Paperback/ broschiert. Etat : 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. N° de réf. du vendeur 292167
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Programming in Networks and Graphs
Edité par
Springer Berlin Heidelberg, 1988
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 . N° de réf. du vendeur 4883974
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Programming in Networks and Graphs : On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Edité par
Springer Berlin Heidelberg, 1988
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540189695
Quantité disponible : 1 disponible(s)
Image d'archives
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)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540189695_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Programming in Networks and Graphs
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 1988, 1988
ISBN 10 : 3540189696
ISBN 13 : 9783540189695
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540189695
Quantité disponible : 1 disponible(s)
Image d'archives
Programming in Networks and Graphs
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 328. N° de réf. du vendeur 2697859516
Quantité disponible : 4 disponible(s)
Image d'archives
Programming in Networks and Graphs
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 328 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 94537827
Quantité disponible : 4 disponible(s)