A GENERALIZED PERMANENT LABELING ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS

被引:0
|
作者
DESROCHERS, M
SOUMIS, F
机构
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:191 / 212
页数:22
相关论文
共 50 条
  • [1] A REOPTIMIZATION ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS
    DESROCHERS, M
    SOUMIS, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 35 (02) : 242 - 254
  • [2] A new algorithm for the shortest-path problem
    Elmasry, Amr
    Shokry, Ahmed
    NETWORKS, 2019, 74 (01) : 16 - 39
  • [3] A generalized shortest path tour problem with time windows
    L. Di Puglia Pugliese
    D. Ferone
    P. Festa
    F. Guerriero
    Computational Optimization and Applications, 2022, 83 : 593 - 614
  • [4] A generalized shortest path tour problem with time windows
    Pugliese, L. Di Puglia
    Ferone, D.
    Festa, P.
    Guerriero, F.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (02) : 593 - 614
  • [5] A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem
    Franceschetti, Anna
    Honhon, Dorothee
    Laporte, Gilbert
    Van Woensel, Tom
    TRANSPORTATION SCIENCE, 2018, 52 (04) : 756 - 768
  • [6] A DUAL ALGORITHM FOR THE CONSTRAINED SHORTEST-PATH PROBLEM
    HANDLER, GY
    ZANG, I
    NETWORKS, 1980, 10 (04) : 293 - 310
  • [7] AN ALGORITHM FOR THE RESOURCE CONSTRAINED SHORTEST-PATH PROBLEM
    BEASLEY, JE
    CHRISTOFIDES, N
    NETWORKS, 1989, 19 (04) : 379 - 394
  • [8] An incremental algorithm for a generalization of the shortest-path problem
    Ramalingam, G
    Reps, T
    JOURNAL OF ALGORITHMS, 1996, 21 (02) : 267 - 305
  • [9] An incremental algorithm for a generalization of the shortest-path problem
    Computer Science Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, Wisconsin 53706
    J Algorithms, 2 (267-305):
  • [10] A Hybrid Algorithm for the shortest-path problem in the graph
    Aghaei, Mohammad Reza Soltan
    Zukarnain, Zuriati Ahmad
    Mamat, Ali
    Zainuddin, Hishamuddin
    2008 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING, 2008, : 251 - +