A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
From MaRDI portal
Publication:3875702
DOI10.1007/BFb0120889zbMath0435.90072OpenAlexW75977199MaRDI 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 problemcomparison of algorithmsalgorithmic performance analysisLIFO implicit enumeration algorithmone-arborescence relaxation
Numerical mathematical programming methods (65K05) Integer programming (90C10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Minimum directed 1-subtree relaxation for score orienteering problem, A successful algorithm for solving directed Hamiltonian path problems, The traveling salesman problem: An update of research
