Pages that link to "Item:Q4210360"
From MaRDI portal
The following pages link to Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (Q4210360):
Displayed 29 items.
- Discrete optimization: an Austrian view (Q537581) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Optimal wire ordering and spacing in low power semiconductor design (Q847831) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
- A note on the approximation of the asymmetric traveling salesman problem. (Q1417511) (← links)
- An asymmetric analog of van der Veen conditions and the traveling salesman problem. II (Q1600886) (← links)
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- The maximum traveling salesman problem on van der Veen matrices (Q1765370) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061) (← links)
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- Computing an eigenvector of a Monge matrix in max-plus algebra (Q2474561) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
- GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY (Q2772854) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← links)
- New exponential neighbourhood for polynomially solvable TSPs (Q3439139) (← links)
- The Number of Flips Required to Obtain Non-crossing Convex Cycles (Q5302750) (← links)
- An asymmetric analogue of van der Veen conditions and the traveling salesman problem (Q5931793) (← links)