On the directed hop-constrained shortest path problem-Reference-Cited by-同舟云学术

On the directed hop-constrained shortest path problem

Published:2004-01 Issue:1 Volume:32 Page:15-22
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Dahl Geir,Gouveia Luis

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference9 articles.

1. Using a hop-constrained model to generate alternative communication network design;Balakrishnan;ORSA J. Comput.,1992

2. Notes on polyhedra associated with hop-constrained paths;Dahl;Oper. Res. Lett.,1999

3. G. Dahl, L. Gouveia, On the directed hop-constrained shortest path problem, Working Paper 1-2002, Centro de Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 2002.

4. Curve approximation constrained shortest path problems;Dahl;Networks,2000

5. Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints;Gouveia;INFORMS J. Comput.,1998

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization algorithms for the k edge-connected L-hop-constrained network design problem;Soft Computing;2024-02-05

2. Protecting Multi-Domain Command and Control Information System Network Traffic with Segment Routing;Proceedings of 2022 10th China Conference on Command and Control;2022

3. The location and location-routing problem for the refugee camp network design;Transportation Research Part B: Methodological;2021-01

4. Network Design with Routing Requirements;Network Design with Applications to Transportation and Logistics;2020-12-09

5. A Dynamic Neural Network for Solving Time-varying Shortest Path with Hop-constraint;Journal of Physics: Conference Series;2020-12-01