Article ID: | iaor2007530 |
Country: | Netherlands |
Volume: | 171 |
Issue: | 1 |
Start Page Number: | 567 |
End Page Number: | 572 |
Publication Date: | Dec 2005 |
Journal: | Applied Mathematics and Computation |
Authors: | Chang Ching-Ter |
Keywords: | programming: travelling salesman |
The purpose of this paper is to present a reformulation of the model presented by Feinstein and Thapa. The approach of Feinstein and Thapa has been accepted as the most efficient technique published, requiring the least number of auxiliary constraints and additional continuous variables. To solve a portfolio optimization problem with