Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 237-255.

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.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik1999-376
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 12 Jan 2012 12:13
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/376