Hub Arc Location Problems: Part II---Formulations and Optimal Algorithms

J. F. Campbell (), A. T. Ernst () and M. Krishnamoorthy ()
Additional contact information
J. F. Campbell: College of Business Administration, University of Missouri--St. Louis, 8001 Natural Bridge Road, St. Louis, Missouri 63121-4499
A. T. Ernst: CSIRO Mathematical and Information Sciences, Private Bag 10, South Bank MDC, Clayton, VIC 3169, Australia
M. Krishnamoorthy: CSIRO Mathematical and Information Sciences, Private Bag 10, South Bank MDC, Clayton, VIC 3169, Australia

Management Science, 2005, vol. 51, issue 10, 1556-1571

Abstract: A companion paper (Campbell et al. 2005) introduces new hub arc location models and analyzes optimal solutions, with special attention to spatial pattens and relationships. This paper provides integer programming formulations and optimal solution algorithms for these problems. We describe two optimal solution approaches in detail and compare their performance, using standard hub location data sets. We present implementation details and show how algorithms can be fine tuned based on characteristics of the data.

Keywords: hub arc location; hub location; network design; integer programming formulations; algorithms (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (47)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1050.0407 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:51:y:2005:i:10:p:1556-1571

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().