Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling
Keywords:
Traveling salesman problem, Gilmore-Gomory TSP, Patching Scheme, Polynomially solvable casesAbstract
One of the most celebrated polynomially solvable cases of the TSP is the Gilmore-Gomory TSP. The patching scheme for the problem developed by Gilmore and Gomory has several interesting features. Its generalization, called the GG-scheme, has been studied by several researchers and polynomially testable sufficiency conditions for its validity have been given, leading to polynomial schemes for large subclasses of the TSP. A good characterization of the subclass of the TSP for which the GG-scheme produces an optimal solution, is an outstanding open problem of both theoretical and practical significance. We give some necessary conditions and a new, polynomially testable sufficiency condition for the validity of the GG-scheme that properly includes all previously known such conditions. Key words: Traveling salesman problem, Gilmore-Gomory TSP, Patching Scheme, Polynomially solvable casesDownloads
Published
2007-02-07
How to Cite
Baki, M. F., & Kabadi, S. N. (2007). Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling. Algorithmic Operations Research, 2(1). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/2731
Issue
Section
Articles