Letter to the Editor—Computing Two-Commodity Flows | Zendy

Bruce Rothschild | Zendy; Andrew B. Whinston | Zendy; Jeremy Kent | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Letter to the Editor—Computing Two-Commodity Flows

Author(s) -

Bruce Rothschild,

Andrew B. Whinston,

Jeremy Kent

Publication year - 1968

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.16.2.446

Subject(s) - commodity , computation , integer (computer science) , computer science , flow (mathematics) , euler's formula , mathematical economics , mathematics , algorithm , economics , finance , programming language , geometry , mathematical analysis

In Opns. Res. 14, 377-387 1966 a max-flow min-cut theorem for two-commodity flows in Euler networks with integer capacities is proved. In this paper we describe an algorithm for constructing maximal two-commodity integer flows based on the proof in the reference cited, and we give computation times for some examples on a Burroughs B-5000 computer.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research