Show simple item record

dc.contributor.authorLamb, John Douglasen
dc.date.accessioned2007-03-20T15:09:05Z
dc.date.available2007-03-20T15:09:05Z
dc.date.issued2007-03-20T15:09:05Z
dc.identifier.issn0143-4543
dc.identifier.urihttp://hdl.handle.net/2164/133
dc.description.abstractThe subtour centre problem is the problem of finding a closed trail S of bounded length on a connected simple graph G that minimises the maximum distance from S to any vertex ofG. It is a central location problem related to the cycle centre and cycle median problems (Foulds et al., 2004; Labbé et al., 2005) and the covering tour problem (Current and Schilling, 1989). Two related heuristics and an integer linear programme are formulated for it. These are compared numerically using a range of problems derived from tsplib (Reinelt, 1995). The heuristics usually perform substantially better then the integer linear programme and there is some evidence that the simpler heuristics perform better on the less dense graphs that may be more typical of applications.en
dc.format.extent872940 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.relation.ispartofseriesUniversity of Aberdeen Business School Working Paper Seriesen
dc.relation.ispartofseriesDiscussion Paper 2007-19en
dc.subjectLocation, Combinatorial optimization, Heuristics, Linear Programmingen
dc.titleThe Subtour Centre Problemen
dc.typeWorking Paperen
dc.contributor.institutionUniversity of Aberdeen, Business School, Management Studiesen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record