Articoli correlati a 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 - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Preliminaries.- Terminology.- Linear Programming.- Combinatorial Optimization.- The Class of General Matching Problems.- Three Cornerstone Problems.- Important Subclasses.- Network Flow Algorithms Revisited.- Prologue: Two Apparently “Easier” Network Flow Problems.- Approaches to Min-Cost Flow Problems.- Near Equivalence of Network Flow Algorithms.- Bipartite Matching Problems.- The Cardinality Matching Problem in Bipartite Graphs.- The Assignment Problem.- The Hitchcock Transportation Problem.- The 1-Matching Problem.- The Cardinality Matching Problem.- The Min-Cost Perfect Matching Problem.- The b-Matching Problem.- Basic Structures and Operations.- b-Matching Algorithms.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Programming in Networks and Graphs: On The Combinatorial...
Immagini fornite dal venditore
Programming in networks and graphs Lecture notes in economics and mathematical systems ; Vol. 300
ISBN 10: 3540189696
ISBN 13: 9783540189695
Antico o usato
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
(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. Codice articolo 2072690
Quantità: 1 disponibili
Immagini fornite dal venditore
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
Antico o usato
Broschiert;
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Valutazione del venditore 5 su 5 stelle
Broschiert; Condizione: Gut. XI, 315 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 540. Codice articolo 1699200
Quantità: 1 disponibili
Foto dell'editore
Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Editore:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Antico o usato
Softcover
Da: Ammareal, Morangis, Francia
Valutazione del venditore 5 su 5 stelle
Softcover. Condizione: 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. Codice articolo E-591-001
Quantità: 1 disponibili
Immagini fornite dal venditore
Programming in Networks and Graphs. On the Combinatorial Background and Near-Equivalence of Networt Flow and Matching Algorithms.
Editore:
Springer Berlin, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Antico o usato
Paperback/ broschiert
Da: ralfs-buecherkiste, Herzfelde, MOL, Germania
Valutazione del venditore 5 su 5 stelle
Paperback/ broschiert. Condizione: 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. Codice articolo 292167
Quantità: 1 disponibili
Immagini fornite dal venditore
Programming in Networks and Graphs
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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 . Codice articolo 4883974
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Programming in Networks and Graphs : On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Editore:
Springer Berlin Heidelberg, 1988
ISBN 10: 3540189696
ISBN 13: 9783540189695
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540189695
Quantità: 1 disponibili
Immagini fornite dal venditore
Programming in Networks and Graphs
ISBN 10: 3540189696
ISBN 13: 9783540189695
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540189695
Quantità: 1 disponibili
Foto dell'editore
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)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540189695_new
Quantità: Più di 20 disponibili
Foto dell'editore
Programming in Networks and Graphs
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 328. Codice articolo 2697859516
Quantità: 4 disponibili
Foto dell'editore
Programming in Networks and Graphs
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 94537827
Quantità: 4 disponibili