A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
From MaRDI portal
Publication:3875702
DOI10.1007/BFb0120889zbMath0435.90072MaRDI QIDQ3875702
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120889
asymmetric travelling salesman problem; comparison of algorithms; algorithmic performance analysis; LIFO implicit enumeration algorithm; one-arborescence relaxation
65K05: Numerical mathematical programming methods
90C10: Integer programming
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
A successful algorithm for solving directed Hamiltonian path problems, Minimum directed 1-subtree relaxation for score orienteering problem, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, The traveling salesman problem: An update of research