A note on asymptotic formulae for one-dimensional network flow problems
type: Item
instance of: scholarly article
title: A note on asymptotic formulae for one-dimensional network flow problems
zbMATH Open document ID: 1151.90333
author: Carlos F. Daganzo
author: Karen Smilowitz
published in: Annals of Operations Research
publication date: 2007-02-15T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5127453
zbMATH Keywords: distance approximations
MaRDI profile type: MaRDI publication profile
full work available at URL: s10479-006-0010-2
OpenAlex ID: W1967850074
cites work: Q5624436
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
DOI: 10.1007/S10479-006-0010-2
Recommended article: Asymptotic behavior of flows in networks
Recommended article: One-way flow network formation under constraints
Recommended article: Asymptotic behaviour of flows on reducible networks
Recommended article: Explicit formulae for limit periodic flows on networks
Recommended article: A note on the existence of Nash networks in one-way flow models
Recommended article: Q3329223
Recommended article: New exact techniques applied to a class of network flow formulations
Recommended article: Network flow problems with one side constraint: A comparison of three solution methods
Recommended article: On the asymptotic behaviour of semigroups for flows in infinite networks
Recommended article: Q5061849
description: scientific article; zbMATH DE number 5127453