Exact methods for solving the elementary shortest and longest path problems

被引：0
|
作者：
Quoc Trung Bui
Yves Deville
Quang Dung Pham
机构：
[1] FPT University,FPT Technology Research Institute
[2] Université catholique de Louvain,ICTEAM Institute
[3] Hanoi University of Science and Technology,School of Information and Communication Technology
来源：
Annals of Operations Research | 2016年 / 244卷
关键词：
Elementary shortest path; Elementary longest path; Negative cycles; Mixed integer programming; Decomposition;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider in this paper the problems of finding the elementary shortest and longest paths on a graph containing negative and positive cycles. These problems are NP-hard. We propose exact algorithms based on mixed integer programming for their solution, employing different valid inequalities. Moreover, we propose decomposition techniques which are very efficient for cases with special structure. Experimental results show the efficiency of our algorithms compared with state of the art exact algorithms.
引用
收藏
页码：313 / 348
页数：35
相关论文
共 50 条
  • [1] Exact methods for solving the elementary shortest and longest path problems
    Quoc Trung Bui
    Deville, Yves
    Quang Dung Pham
    ANNALS OF OPERATIONS RESEARCH, 2016, 244 (02) : 313 - 348
  • [2] Solving elementary shortest-path problems as mixed-integer programs
    Michael Drexl
    Stefan Irnich
    OR Spectrum, 2014, 36 : 281 - 296
  • [3] Solving elementary shortest-path problems as mixed-integer programs
    Drexl, Michael
    Irnich, Stefan
    OR SPECTRUM, 2014, 36 (02) : 281 - 296
  • [4] An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems
    Thomas, Barrett W.
    Calogiuri, Tobia
    Hewitt, Mike
    NETWORKS, 2019, 73 (02) : 187 - 205
  • [5] On solving dynamic shortest path problems
    Nasrabadi, Ebrahim
    Hashemi, S. Mehdi
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 48 - 53
  • [6] Genetic algorithms for solving shortest path problems
    Gen, M
    Cheng, RW
    Wang, DW
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 401 - 406
  • [7] An applicable method for solving the shortest path problems
    Zamirian, M.
    Farahi, M. H.
    Nazemi, A. R.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 190 (02) : 1479 - 1486
  • [8] Solving resource constrained shortest path problems with LP-based methods
    Horvath, Marko
    Kis, Tamas
    COMPUTERS & OPERATIONS RESEARCH, 2016, 73 : 150 - 164
  • [9] A numerical method for solving shortest path problems
    Skandari, M. H. Noori
    Ghaznavi, M.
    CALCOLO, 2018, 55 (01)
  • [10] A numerical method for solving shortest path problems
    M. H. Noori Skandari
    M. Ghaznavi
    Calcolo, 2018, 55
12345