An integer linear programming model for the constrained shortest path tour problem

Electronic Notes in Discrete Mathematics - Tập 69 - Trang 141-148 - 2018
Rafael Castro de Andrade1
1Department of Statistics and Applied Mathematics, Federal University of Ceará, Campus do Pici, BL 910, CEP 60.440-900, Fortaleza, Brazil

Tài liệu tham khảo

Andrade, 2016, New formulations for the elementary shortest-path problem visiting a given set of nodes, European Journal of Operational Research, 254, 755, 10.1016/j.ejor.2016.05.008

Bertossi, 1981, The edge hamiltonian path problem is NP-complete, Information Processing Letters, 13, 157, 10.1016/0020-0190(81)90048-X

Ferone, 2016, The constrained shortest path tour problem, Computers & Operations Research, 74, 64, 10.1016/j.cor.2016.04.002

Festa, 2012, Complexity analysis and optimization of the shortest path tour problem, Optimization Letters, 6, 163, 10.1007/s11590-010-0258-y

Festa, 2013, Solving the shortest path tour problem, European Journal of Operational Research, 230, 464, 10.1016/j.ejor.2013.04.029

Festa, 2003

Heegaard, 2009, Network survivability modeling, Computer Networks, 53, 1215, 10.1016/j.comnet.2009.02.014

Thông tin
Thông tin xuất bản

Electronic Notes in Discrete Mathematics

Tập 69

141-148

Thông tin tác giả