Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- 1 October 2005
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 51 (10), 1556-1571
- https://doi.org/10.1287/mnsc.1050.0407
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
This publication has 14 references indexed in Scilit:
- Hub Arc Location Problems: Part I—Introduction and ResultsManagement Science, 2005
- Preprocessing and cutting for multiple allocation hub location problemsEuropean Journal of Operational Research, 2004
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median ProblemsINFORMS Journal on Computing, 1998
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 1998
- New formulation and relaxation to solve a concave-cost network flow problemJournal of the Operational Research Society, 1997
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- Using a Hop-Constrained Model to Generate Alternative Communication Network DesignINFORMS Journal on Computing, 1992
- Topological design of computer communication networks — The overall design problemEuropean Journal of Operational Research, 1992
- A composite algorithm for a concave‐cost network flow problemNetworks, 1989