Traffic flow information for minimum cost routing procedures

DOI10.1016/0005-1098(69)90010-7MaRDI QIDQ2534089zbMATH OpenOpenAlexFDO

Authors B. jun. Yaged

Publication date 1969

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0005-1098(69)90010-7

zbMATH Keywords

operations research

Cites work

• A Decomposition Algorithm for Shortest Paths in a Network
• scientific article; zbMATH DE number 3302126 (Why is no real title available?)

Cited in

(1)

• Minimum cost routing for static network models

This page was built for publication: Traffic flow information for minimum cost routing procedures

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