Pages that link to "Item:Q5665016"
From MaRDI portal
The following pages link to Technical Note—Bounds for the Travelling-Salesman Problem (Q5665016):
Displaying 14 items.
- On dual solutions of the linear assignment problem (Q761971) (← links)
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984) (← links)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Bounds for 3-matroid intersection problems (Q1218336) (← links)
- Bi-objective data gathering path planning for vehicles with bounded curvature (Q1652333) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
- Improving Christofides' lower bound for the traveling salesman problem (Q3698662) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← 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)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
