A new Lagrangean Approach for the Travelling Salesman Problem
dc.contributor.author | Jörnsten, Kurt | |
dc.contributor.author | Kalcsics, Jörg | |
dc.date.accessioned | 2015-01-22T06:55:20Z | |
dc.date.available | 2015-01-22T06:55:20Z | |
dc.date.issued | 2015-01-19 | |
dc.identifier.issn | 1500-4066 | |
dc.identifier.uri | http://hdl.handle.net/11250/274519 | |
dc.description.abstract | In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman problem more suitable for Lagrangean relaxation and analyse the new approach on examples from TSP Lib. Furthermore the Lagrangean relaxed subproblems are travelling salesman alike which means that almost all that is known on the travelling salesman polytope can be used when the subproblems are to be solved. | nb_NO |
dc.language.iso | eng | nb_NO |
dc.publisher | FOR | nb_NO |
dc.relation.ispartofseries | Discussion paper;04/15 | |
dc.subject | travelling salesman | nb_NO |
dc.subject | lagrangean relaxation | nb_NO |
dc.subject | mathematical programming | nb_NO |
dc.title | A new Lagrangean Approach for the Travelling Salesman Problem | nb_NO |
dc.type | Working paper | nb_NO |
Tilhørende fil(er)
Denne innførselen finnes i følgende samling(er)
-
Discussion papers (FOR) [566]