Pages that link to "Item:Q5616730"
From MaRDI portal
The following pages link to The Shortest Hamiltonian Chain of a Graph (Q5616730):
Displaying 11 items.
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
- A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
- Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering (Q4394324) (← links)
- Algorithm for tool placement in an automatic tool change magazine (Q4398912) (← links)
