Vis enkel innførsel

dc.contributor.authorJörnsten, Kurt
dc.contributor.authorKalcsics, Jörg
dc.date.accessioned2015-01-22T06:55:20Z
dc.date.available2015-01-22T06:55:20Z
dc.date.issued2015-01-19
dc.identifier.issn1500-4066
dc.identifier.urihttp://hdl.handle.net/11250/274519
dc.description.abstractIn 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.isoengnb_NO
dc.publisherFORnb_NO
dc.relation.ispartofseriesDiscussion paper;04/15
dc.subjecttravelling salesmannb_NO
dc.subjectlagrangean relaxationnb_NO
dc.subjectmathematical programmingnb_NO
dc.titleA new Lagrangean Approach for the Travelling Salesman Problemnb_NO
dc.typeWorking papernb_NO


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel