Pages that link to "Item:Q1302605"
From MaRDI portal
The following pages link to Solving the \(k\)-best traveling salesman problem (Q1302605):
Displaying 16 items.
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- \(k\)-shortest routing of trains on shunting yards (Q841591) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (Q1357488) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- (Q3211117) (← links)
- The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- (Q5111875) (← links)
- Solution of a traveling salesman problem in computer component design (Q5184671) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q5378639) (← links)
- Finding the K mean-standard deviation shortest paths under travel time uncertainty (Q6569063) (← links)