Feasibility of Two Commodity Network Flows

DOI10.1287/OPRE.14.6.1121MaRDI QIDQ5560796zbMATH OpenOpenAlexFDO

Authors Bruce Rothschild, Andrew B. Whinston

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

Cited in

(19)

• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Short proofs on multicommodity flows and cuts
• Two commodity flows
• Multiflows and disjoint paths of minimum total cost
• The parsimonious property of cut covering problems and its applications
• Packing odd circuits in Eulerian graphs
• The geometry of graphs and some of its algorithmic applications
• NP-completeness of some edge-disjoint paths problems
• Multiflow Feasibility: An Annotated Tableau
• A survey on flows in graphs and matroids
• On some connectivity properties of Eulerian graphs
• Computation of the forwarding index via flows: A note
• 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
• Some problems in discrete optimization
• Two commodity network flows and linear programming
• High-accuracy multicommodity flows via iterative refinement
• On cuts and matchings in planar graphs
• Multiflows in symmetric digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560796)