GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
From MaRDI portal
Publication:2772854
DOI10.1142/S0219198901000415zbMath1127.90396OpenAlexW2142502904MaRDI QIDQ2772854
Publication date: 19 February 2002
Published in: International Game Theory Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219198901000415
Related Items (1)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the traveling salesman problem with a relaxed Monge matrix
- Extreme Hamiltonian lines
- Recognition of Gilmore-Gomory traveling salesman problem
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- The travelling salesman problem on permuted Monge matrices
- Gilmore-Gomory type traveling salesman problems
- Pyramidal traveling salesman problem
- Special cases of the traveling salesman problem
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- Nonpreemptive Ensemble Motion Planning on a Tree
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The traveling salesman problem on a graph and some related integer polyhedra
- Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Dynamic programming and the graphical traveling salesman problem
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- Pyramidal tours for the traveling salesman
- Edgeconvex Circuits and the Traveling Salesman Problem
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
This page was built for publication: GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
