Pages that link to "Item:Q3989345"
From MaRDI portal
The following pages link to Polynomially solvable traveling salesman problems (Q3989345):
Displaying 23 items.
- A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems (Q466000) (← links)
- Classifying traveling salesman problems (Q917447) (← links)
- Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) (← links)
- Optimal arcs for the traveling salesman problem (Q1195644) (← links)
- New classes of efficiently solvable generalized traveling salesman problems (Q1290165) (← links)
- Gilmore-Gomory type traveling salesman problems (Q1302599) (← links)
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
- (Q3059494) (← links)
- New exponential neighbourhood for polynomially solvable TSPs (Q3439139) (← links)
- The traveling salesman problem in graphs with 3-edge cutsets (Q3773723) (← links)
- (Q3813626) (← links)
- Solvable classes of generalized traveling salesman problems (Q3973407) (← links)
- Three easy special cases of the euclidean travelling salesman problem (Q4372111) (← links)
- The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- Sometimes travelling is easy: The master tour problem (Q6102296) (← links)