Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford-Fulkerson algorithm - Softcover
Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In optimization theory, the maximum flow problem is to find a feasible flow through a single-source, single-sink flow network that is maximum. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.
"synopsis" may belong to another edition of this title.
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In optimization theory, the maximum flow problem is to find a feasible flow through a single-source, single-sink flow network that is maximum. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.
"About this title" may belong to another edition of this title.
Search results for Maximum flow problem: Optimization (mathematics), Flow...
Stock Image
Maximum flow problem
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch. Seller Inventory # 9786132747433
Buy New
US$ 161.40
US$ 26.50 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Maximum flow problem
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In optimizationtheory, the maximum flow problem is to find a feasible flow through asingle-source, single-sink flow network that is maximum. The maximumflow problem can be seen as a special case of more complex network flowproblems, such as the circulation problem. The maximum value of an s-tflow is equal to the minimum capacity of an s-t cut in the network, asstated in the max-flow min-cut theorem.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. Seller Inventory # 9786132747433
Buy New
US$ 161.40
US$ 69.13 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Maximum flow problem : Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford-Fulkerson algorithm
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Seller Inventory # 9786132747433
Buy New
US$ 163.34
US$ 69.89 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available