Answers are grounded in this paper and cite their sources.
In this article we study the use of formulations with precedence relation variables for the Precedence Constrained Asymmetric Travelling Salesman (PCATS) problem. Contrary to previous articles, the emphasis of this article is on formulations involving exponential sized sets of inequalities and on the development of a cutting plane method together with polynomial routines for separating the new inequalities. Our computational results, taken from a set of benchmark instances, show that our methods improve significantly on most of the best previously known lower bound values.
No takes yet. Share an insight, caveat, or question.
Gouveia et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: