Feasibility of Two Commodity Network Flows

DOI10.1287/OPRE.14.6.1121zbMath0173.21703OpenAlexW2103370757MaRDI QIDQ5560796

Andrew B. Whinston, Bruce L. Rothschild

Publication date: 1966

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.14.6.1121

zbMATH Keywords

operations research

Related Items (18)

Two commodity flows ⋮ A survey on flows in graphs and matroids ⋮ The geometry of graphs and some of its algorithmic applications ⋮ NP-completeness of some edge-disjoint paths problems ⋮ Multiflows and disjoint paths of minimum total cost ⋮ The parsimonious property of cut covering problems and its applications ⋮ Computation of the forwarding index via flows: A note ⋮ Some problems in discrete optimization ⋮ Packing odd circuits in Eulerian graphs ⋮ Two commodity network flows and linear programming ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ The Maximum Flow Problem for Oriented Flows ⋮ Short proofs on multicommodity flows and cuts ⋮ On some connectivity properties of Eulerian graphs ⋮ On cuts and matchings in planar graphs ⋮ Multiflows in symmetric digraphs ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm

This page was built for publication: Feasibility of Two Commodity Network Flows