Skip to main content
Article thumbnail
Location of Repository

The Subtour Centre Problem

By John Douglas Lamb


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

Topics: Location, Combinatorial optimization, Heuristics, Linear Programming
Year: 2007
OAI identifier:

Suggested articles


  1. (1996). A review of extensive facility location in networks. doi
  2. (1996). A review of extensive facility location in networks.EuropeanJounalofOperationalResearch95,595–603. RDevelopmentCoreTeam,2006.R:ALanguageandEnvironmentforStatistical Computing. R Foundation for Statistical Computing,
  3. (1985). A simple heuristic for the p-centre problem. doi
  4. (1972). An analysis of several heuristics for the traveling salesman problem. doi
  5. (1973). An effective heuristic algorithm for the traveling salesman problem. doi
  6. (1994). Approximation algorithms for the geometric covering salesman problem. doi
  7. (1998). Combinatorial Optimization. JohnWiley and sons,
  8. (2007).∼cms127/code.html, accessed February2007. Lin,S.,Kernighan,B.W.,1973.Aneffectiveheuristicalgorithmforthetraveling salesmanproblem.OperationsResearch21,498–516.
  9. (2006). Insertion heuristics for cycle centre problems, doi
  10. (2003). Lexicographic local search and the p-center problem. doi
  11. (2003). Lexicographic local search and the p-centerproblem.EuropeanJournalofOperationalResearch151,265–279. doi
  12. (1982). Locating central paths in a graph. doi
  13. (2005). Locating median cycles in networks. doi
  14. (1989). Maximal direct covering tree problems. doi
  15. (2004). Modelling and solving central cycle problems with integer programming. doi
  16. (1992). Optimal routing and process scheduling for a mobile service facility. doi
  17. (1992). Optimal routing and process scheduling for a mobileservicefacility.Networks22,163–183. Arkin,E.M.,Hassin,R.,1994.Approximationalgorithmsforthegeometric coveringsalesmanproblem.DiscreteAppliedMathematics55,197–218.
  18. (1964). Optimum location of switching centres and the absolute centres andmedians of a graph.
  19. (2006). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing,
  20. (2002). The boost graph library. doi
  21. (1989). The covering salesman problem. doi
  22. (1997). The covering tour problem. doi
  23. (1984). The p-centre problem—heuristic and optimal algorithms. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.