The sensitivity of a traffic network

DOI10.1016/0016-0032(64)90089-4MaRDI QIDQ2551066zbMATH OpenOpenAlexFDO

Authors Stephen S. Yau

Publication date 1964

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(64)90089-4

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• A generalization of the cut-set
• An Application of Generalized Linear Programming to Network Flows
• Maximal Flow Through a Network
• Multi-Terminal Network Flows
• Synthesis of a Communication Net

This page was built for publication: The sensitivity of a traffic network

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