Abstract.
This is the first of a series of two papers dedicated to efficient separation heuristics for violated inequalities in the context of solving to optimality instances of the Traveling Salesman Problem via branch-and-cut. In this paper we give the basic ideas behind these heuristics and design heuristics for comb separation. The second paper will deal with more complex inequalities such as Clique Tree, Star or Path and Ladder inequalities and give computational results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 1999 / Accepted: August 2001¶Published online February 14, 2002
Rights and permissions
About this article
Cite this article
Naddef, D., Thienel, S. Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Program. 92, 237–255 (2002). https://doi.org/10.1007/s101070100275
Issue Date:
DOI: https://doi.org/10.1007/s101070100275