Maximum flow problem optimization (1 risultati)

Titolo
Perfeziona con la Ricerca avanzata

Perfeziona la tua ricerca

  • Libri (1)

  • Nuovo (1)

  • Con foto (1)

a

Fascia di prezzo personalizzata (EUR)

a

    • Lingua: Inglese

      Editore: Omniscriptum, 2010

      6132747435 / 9786132747433

      • Brossura
      • Print on Demand

      Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 189,66

      EUR 30,50 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: 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.