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)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
On the Sensitivity of the Gravity Model ⋮ 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 ⋮ On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem ⋮ Entropy maximization model for the trip distribution problem with fuzzy and random parameters ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ The stochastic multicommodity flow problem ⋮ Iterative methods for determining the k shortest paths in a network ⋮ A product form representation of the inverse of a multicommodity cycle matrix ⋮ On algorithms for finding the k shortest paths in a network ⋮ An institutionalized Divvy economy ⋮ The dynamic transportation problem: A survey ⋮ Multicommodity network flows—A survey ⋮ Entropy of freight transportation and price variation ⋮ The Braess paradox
