Exact methods for solving the elementary shortest and longest path problems

Quoc Trung Bui (), Yves Deville () and Quang Dung Pham ()
Additional contact information
Quoc Trung Bui: FPT University
Yves Deville: Université catholique de Louvain
Quang Dung Pham: Hanoi University of Science and Technology

Annals of Operations Research, 2016, vol. 244, issue 2, No 3, 313-348

Abstract: Abstract 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.

Keywords: Elementary shortest path; Elementary longest path; Negative cycles; Mixed integer programming; Decomposition (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2116-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:244:y:2016:i:2:d:10.1007_s10479-016-2116-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2116-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().