Flows in transportation networks

MaRDI QIDQ2555818zbMATH OpenFDO

Authors Renfrey B. Potts, Robert M. Oliver

Publication date 1972

Published in Mathematics in Science and Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(15)

• 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
• Turning restriction design in traffic networks with a budget constraint
• Entropy maximization model for the trip distribution problem with fuzzy and random parameters

This page was built for publication: Flows in transportation networks

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