A NOTE ON THE CONSTRAINED SHORTEST-PATH PROBLEM

被引:3
|
作者
PUJARI, AK
AGARWAL, S
GULATI, VP
机构
关键词
D O I
10.1002/nav.3800310110
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:87 / 89
页数:3
相关论文
共 50 条
  • [31] APPROXIMATION SCHEMES FOR THE RESTRICTED SHORTEST-PATH PROBLEM
    HASSIN, R
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (01) : 36 - 42
  • [32] A shortest-path network problem in a fuzzy environment
    Lin, FT
    [J]. 10TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3: MEETING THE GRAND CHALLENGE: MACHINES THAT SERVE PEOPLE, 2001, : 1096 - 1100
  • [33] The Fixed-Charge Shortest-Path Problem
    Engineer, Faramroze G.
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    Song, Jin-Hwa
    [J]. INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) : 578 - 596
  • [34] A SUCCESSIVE SHORTEST-PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM
    ENGQUIST, M
    [J]. INFOR, 1982, 20 (04) : 370 - 384
  • [35] A NOTE ON THE SHORTEST-PATH THROUGH A GIVEN LINK IN A NETWORK
    LAU, HT
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1986, 33 (01): : 109 - 110
  • [36] Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation
    Arias-Castro, Ery
    Le Gouic, Thibaut
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2019, 62 (01) : 1 - 28
  • [37] A SHORT PATH TO THE SHORTEST-PATH
    LAX, PD
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (02): : 158 - 159
  • [38] THE KAPPA MOST VITAL ARCS IN THE SHORTEST-PATH PROBLEM
    MALIK, K
    MITTAL, AK
    GUPTA, SK
    [J]. OPERATIONS RESEARCH LETTERS, 1989, 8 (04) : 223 - 227
  • [39] Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks
    Sohn, Sungryull
    Lee, Sungtae
    Choi, Jongwook
    van Seijen, Harm
    Fatemi, Mehdi
    Lee, Honglak
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [40] Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems
    Carlyle, W. Matthew
    Royset, Johannes O.
    Wood, R. Kevin
    [J]. NETWORKS, 2008, 52 (04) : 256 - 270