scholarly journals BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems

2017 ◽  
Vol E100.D (12) ◽  
pp. 2945-2952
Author(s):  
Fumito TAKEUCHI ◽  
Masaaki NISHINO ◽  
Norihito YASUDA ◽  
Takuya AKIBA ◽  
Shin-ichi MINATO ◽  
...  
Keyword(s):  
Shortest Path ◽  
Fast Method ◽  
Shortest Path Problems ◽  
Constrained Shortest Path

Lagrangian relaxation and enumeration for solving constrained shortest-path problems

Networks ◽  
2008 ◽  
Vol 52 (4) ◽  
pp. 256-270 ◽  
Author(s):  
W. Matthew Carlyle ◽  
Johannes O. Royset ◽  
R. Kevin Wood
Keyword(s):  
Lagrangian Relaxation ◽  
Shortest Path ◽  
Shortest Path Problems ◽  
Constrained Shortest Path

scholarly journals Robust constrained shortest path problems under budgeted uncertainty

Networks ◽  
2015 ◽  
Vol 66 (2) ◽  
pp. 98-111 ◽  
Author(s):  
Artur Alves Pessoa ◽  
Luigi Di Puglia Pugliese ◽  
Francesca Guerriero ◽  
Michael Poss
Keyword(s):  
Shortest Path ◽  
Shortest Path Problems ◽  
Constrained Shortest Path ◽  
Budgeted Uncertainty

Solvingk-shortest and constrained shortest path problems efficiently

1989 ◽  
Vol 20 (1) ◽  
pp. 249-282 ◽  
Author(s):  
Christopher C. Skiscim ◽  
Bruce L. Golden
Keyword(s):  
Shortest Path ◽  
Shortest Path Problems ◽  
Constrained Shortest Path
Sign in / Sign up

Export Citation Format

Share Document