Modelling and solving central cycle problems with integer programming
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Preprint |
| Published: |
2000
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/2019 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|