On Two Commodity Network Flows

From MaRDI portal
Publication:5516551

DOI10.1287/opre.14.3.377zbMath0141.35904OpenAlexW2113227678MaRDI QIDQ5516551

Bruce L. 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.3.377




Related Items

Two commodity flowsGenerate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodesA two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodityDistances and cuts in planar graphsSystem capacity for a two-commodity multistate flow network with unreliable nodes and capacity weightA \(T_X\)-approach to some results on cuts and metricsOn a multicommodity stochastic-flow network with unreliable nodes subject to budget constraintTwo commodity network flows and linear programmingMatroids and multicommodity flowsUnnamed ItemTree metrics and edge-disjoint \(S\)-pathsAn algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cutsShort proofs on multicommodity flows and cutsTwo-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal pathsPerformance evaluation for a transportation system in stochastic caseThe biobjective undirected two-commodity minimum cost flow problemMinimal multicut and maximal integer multiflow: a surveyA new strategy for the undirected two-commodity maximum flow problemStudy on the multicommodity reliability of a capacitated-flow networkHalf-integral five-terminus flowsClassification de certaines matrices 0-1A two-commodity cut theoremOn one maximum multiflow problem and related metricsMetrics and undirected cutsMeasure the quality level for a supplier-demand system by a multicommodity stochastic-flow networkThe multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm