Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2019

Title: Modelling and solving central cycle problems with integer programming
Authors: Foulds, L.R.
Wilson, John M.
Yamaguchi, T.
Keywords: Cycle centre
Cycle centroid
Cycle median
Graph
Heuristic
Integer programming
Location
Issue Date: 2000
Publisher: © Loughborough University
Citation: FOULDS, L.R., WILSON, J.M. and YAMAGUCHI, T., 2000. Modelling and solving central cycle problems with integer programming. Occasional Paper 2000:6, Loughborough: Business School, Loughborough University.
Abstract: We consider the problem of identifying a central subgraph of a given simple connected graph. The case where the subgraph comprises a discrete set of vertices is well known. However, the concept of eccentricity can be extended to connected subgraphs such as: paths, trees and cycles. Methods have been reported which deal with the requirement that the subgraph is a path or a constrained tree. We extend this work to the case where the subgraph is required to be a cycle. We report on computational experience with integer programming models of the problems of identifying cycle centres, cycle medians and cycle centroids, and also on a heuristic based on the first model. The problems have applications in facilities location, particularly the location of emergency facilities, and service facilities.
Description: THIS PAPER IS CIRCULATED FOR DISCUSSION PURPOSES AND ITS CONTENTS SHOULD BE CONSIDERED PRELIMINARY AND CONFIDENTIAL. NO REFERENCE TO MATERIAL CONTAINED HEREIN MAY BE MADE WITHOUT THE CONSENT OF THE AUTHORS.
URI: https://dspace.lboro.ac.uk/2134/2019
ISBN: 1859011675
Appears in Collections:Occasional Papers Series (Business School)

Files associated with this item:

File Description SizeFormat
2000-6.pdf466.53 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.