A note on asymptotic formulae for one-dimensional network flow problems

DOI10.1007/S10479-006-0010-2zbMATH Open1151.90333OpenAlexW1967850074MaRDI QIDQ867547

Carlos F. Daganzo, Karen R. Smilowitz

Publication date: 15 February 2007

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0010-2

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

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

Cites Work

• Bounds and Heuristics for Capacitated Routing Problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Explicit formulae for limit periodic flows on networks 👍 👎
• One-way flow network formation under constraints 👍 👎
• Asymptotic behaviour of flows on reducible networks 👍 👎
• A note on the existence of Nash networks in one-way flow models 👍 👎
• Network flow problems with one side constraint: A comparison of three solution methods 👍 👎
• New exact techniques applied to a class of network flow formulations 👍 👎
• On the asymptotic behaviour of semigroups for flows in infinite networks 👍 👎
• Asymptotic behavior of flows in networks 👍 👎

This page was built for publication: A note on asymptotic formulae for one-dimensional network flow problems

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