Publisher
Springer International Publishing
Reference51 articles.
1. Balakrishnan, A., & Altinkemer, K. (1992). Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4, 192–205.
2. Barahona, F. (1992). Separating from the dominant of the spanning tree polytope. Operations Research Letters, 12, 201–203.
3. Bendali, F., Diarrassouba, I., Mahjoub, A., & Mailfert, J. (2010). The edge-disjoint 3-hop-constrained paths polytope. Discrete Optimization, 7(4), 222–233.
4. Bley, A. (2003). On the complexity of vertex-disjoint length-restricted path problems. Computational Complexity, 12(3–4), 131–149.
5. Bley, A., & Neto, J. (2010). Approximability of 3- and 4-hop bounded disjoint paths problems. In Proceedings of IPCO 2010, Lausanne. Lecture notes in computer science (vol. 6080, pp 205–218). Berlin: Springer.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27