Maximum Flow Problem Optimization (1 results)

Title
Refine with Advanced Search

Refine your search

  • Books (1)

  • New (1)

to

Custom price range (£)

to

    • Language: English

      Published by Omniscriptum, 2010

      6132747435 / 9786132747433

      • Softcover
      • Print on Demand

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      £ 167.44

      £ 26.14 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.