Classification of travelling salesman problem formulations

Classification of travelling salesman problem formulations

0.00 Avg rating0 Votes
Article ID: iaor1991276
Country: Netherlands
Volume: 9
Issue: 2
Start Page Number: 127
End Page Number: 132
Publication Date: Mar 1990
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: travelling salesman
Abstract:

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose of this paper is to clarify the relations between these formulations and with other classical formulations. Some results are probably known by researchers in the area. However they have not yet been published. This paper groups them together.

Reviews

Required fields are marked *. Your email address will not be published.