Pages that link to "Item:Q2639760"
From MaRDI portal
The following pages link to Special cases of travelling salesman problems and heuristics (Q2639760):
Displaying 14 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Optimal wire ordering and spacing in low power semiconductor design (Q847831) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- Optimal arcs for the traveling salesman problem (Q1195644) (← links)
- Special issue: The traveling salesman problem (Q1302595) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Spanning trees and shortest paths in Monge graphs (Q1382772) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- A Note On Kalmanson Matrices<sup>∗</sup> (Q4342970) (← links)
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms (Q4347415) (← links)
- Pyramidal tours for the traveling salesman (Q4764887) (← links)