The Shortest Hamiltonian Chain of a Graph
From MaRDI portal
Cited in
(12)- 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
- Large multiple neighborhood search for the clustered vehicle-routing problem
- New lower bounds for the symmetric travelling salesman problem
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A New Formulation for the Travelling Salesman Problem
- A restricted Lagrangean approach to the traveling salesman 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
- Distributed estimation algorithms on undirected chained graphs with explicit characterization of consensus
This page was built for publication: The Shortest Hamiltonian Chain of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616730)
