Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
James F. Campbell, Andreas T Ernst, Mohan Krishnamoorthy
Abstract
James F. Campbell, Andreas T Ernst, Mohan Krishnamoorthy
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.
OpenAlex reports 147 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Integer programming, Computer science, Algorithm, Integer (computer science), Mathematical optimization, Arc (geometry), Mathematics, Programming language