The Subtour Centre Problem

Research output: Working paperDiscussion paper

Abstract

The 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.
Original languageEnglish
PublisherUniversity of Aberdeen Business School
Number of pages21
Publication statusPublished - Mar 2007

Publication series

NameUniversity of Aberdeen Business School Working Paper Series
No.19
Volume2007
ISSN (Print)0143-4543

Fingerprint Dive into the research topics of 'The Subtour Centre Problem'. Together they form a unique fingerprint.

  • Cite this

    Lamb, J. D. (2007). The Subtour Centre Problem. (University of Aberdeen Business School Working Paper Series; Vol. 2007, No. 19). University of Aberdeen Business School. http://hdl.handle.net/2164/133