The Shortest Hamiltonian Chain of a Graph
From MaRDI portal
Publication:5616730
DOI10.1137/0119070zbMath0214.23403OpenAlexW2016493933MaRDI QIDQ5616730
Publication date: 1970
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0119070
Related Items
Worst-case analysis of a new heuristic for the travelling salesman problem, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, The traveling salesman problem: An overview of exact and approximate algorithms, A New Formulation for the Travelling Salesman Problem, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, Large multiple neighborhood search for the clustered vehicle-routing problem, Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering, Algorithm for tool placement in an automatic tool change magazine, A restricted Lagrangean approach to the traveling salesman problem, New lower bounds for the symmetric travelling salesman problem
