ALGORITHMS FOR FINDING PATHS WITH MULTIPLE CONSTRAINTS.

被引:0
|
作者
Jaffe, Jeffrey M.
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
An NP-complete problem with important practical applications is analyzed, and it is shown how to solve it for all practical purposes. An algorithm solves it in polynomial time if the lengths and weights have a small range of values. It is also shown how to approximate the problem if one only had a small amount of time available.
引用
收藏
页码:668 / 676
相关论文
共 50 条
  • [1] ALGORITHMS FOR FINDING PATHS WITH MULTIPLE CONSTRAINTS
    JAFFE, JM
    NETWORKS, 1984, 14 (01) : 95 - 116
  • [2] Multiple QoS Constraints Finding Paths Algorithm in TMN
    Li Qianmu
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2011, 14 (03): : 731 - 737
  • [3] RANDOM-SEARCH ALGORITHMS WITH LINEAR CONSTRAINTS.
    Zak, Yu.A.
    1600, (07):
  • [4] RELIABILITY OPTIMIZATION PROBLEMS WITH MULTIPLE CONSTRAINTS.
    Chern, Maw-Sheng
    Jan, Rong-Hong
    1986, (R-35)
  • [5] A *Prune: An algorithm for finding K shortest paths subject to multiple constraints
    Liu, G
    Ramakrishnan, KG
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 743 - 749
  • [6] Novels in constraints.
    Schilling, Derek
    FRENCH REVIEW, 2006, 80 (01): : 220 - 221
  • [7] COMPUTATIONAL STRUCTURES OF ALGORITHMS FOR FINDING PATHS IN A GRAPH
    SEDUKHIN, SG
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1985, 23 (03): : 1 - 7
  • [8] Invariant algorithms for automatically finding 'signal paths'
    Danyaev, A.S.
    Prokof'ev, V.N.
    Optoelectronics, instrumentation, and data processing, 1988, (06) : 58 - 61
  • [9] Efficient algorithms for finding disjoint paths in grids
    Chan, WT
    Chin, FYL
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 454 - 463
  • [10] Adaptive mirror descent algorithms in convex programming problems with Lipschitz constraints.
    Stonyakin, Fedor Sergeevich
    Alkousa, Mohammad S.
    Stepanov, Aleksei Nikolaevich
    Barinov, Maksim Aleksandrovich
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2018, 24 (02): : 266 - 279