Author:
Feldmann R.,Gairing M.,Lücking Thomas,Monien Burkhard,Rode Manuel
Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Beckmann, M.J.: On the theory of traffic flow in networks. Traffic Quart 21, 109–116 (1967)
2. Brucker, P., Hurink, J., Werner, F.: Improving local search heuristics for some scheduling problems. part II. Discrete Applied Mathematics 72, 47–69 (1997)
3. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven and London (1956)
4. Braess, D.: Über ein Paradoxon der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1968)
5. Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM Journal on Computing 9(1), 91–103 (1980)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献