Three value TSP and linkages with the three value linear spanning 2-forests
From MaRDI portal
Publication:765337
Recommendations
Cites Work
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 2064414 (Why is no real title available?)
- scientific article; zbMATH DE number 3451687 (Why is no real title available?)
- A characterization of linear admissible transformations for the m- travelling salesmen problem
- A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
- Graphs in which all Hamiltonian cycles have the same length
- Hamiltonian path and symmetric travelling salesman polytopes
- On constant-weight TSP-tours
- On cost matrices with two and three distinct values of Hamiltonian paths and cycles
- Properties of the trajectories of the appointments problem and the travelling-salesman problem
- Recognition of Gilmore-Gomory traveling salesman problem
- Study of an algorithm for solving the travelling salesman problem
- Weighted graphs with all Hamiltonian cycles of the same length
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
This page was built for publication: Three value TSP and linkages with the three value linear spanning 2-forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765337)