Publisher
Springer Berlin Heidelberg
Reference47 articles.
1. Ahuj, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows, New Jersey (1993)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NPcompleteness. W. H. Freeman, San Francisco (1979)
3. Hansen, P.: Bicriterion path problems. In: Proceeding 3rd Conference Multiple Criteria Decision Making Theory and Application, pp. 109–127 (1979)
4. Skriver, A.J.V., Andersen, K.A.: A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research 27(6), 507–524 (2000)
5. Azaron, A.: Bicriteria shortest path in networks of queues. Applied Mathematics & Comput. 182(1), 434–442 (2006)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献