Publisher
Springer International Publishing
Reference18 articles.
1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory Algorithms and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993)
2. A. Balakrishnan, K. Altinkemer, Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4, 192–205 (1992)
3. C. Bornstein, N. Maculan, M. Pascoal, L.L. Pinto, Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. Comput. Oper. Res. 39, 1969–1976 (2012)
4. J. Brumbaugh-Smith, D. Shier, An empirical investigation of some bicriterion shortest path algorithms. Eur. J. Oper. Res. 43, 216–224 (1989)
5. G. Cheng, N. Ansari, Finding a least hop(s) path subject to multiple additive constraints. Comput. Commun. 29, 392–401 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献