Flows in transportation networks
From MaRDI portal
Publication:2555818
zbMath0246.90010MaRDI QIDQ2555818
Robert M. Oliver, Renfrey B. Potts
Publication date: 1972
Published in: Mathematics in Science and Engineering (Search for Journal in Brave)
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90B10: Deterministic network models in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Entropy maximization model for the trip distribution problem with fuzzy and random parameters, On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem, An institutionalized Divvy economy, Entropy of freight transportation and price variation, An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints, Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models, The stochastic multicommodity flow problem, On algorithms for finding the k shortest paths in a network, The dynamic transportation problem: A survey, The Braess paradox, On the Sensitivity of the Gravity Model, Iterative methods for determining the k shortest paths in a network, A product form representation of the inverse of a multicommodity cycle matrix, Multicommodity network flows—A survey
