Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
为枢纽弧选址问题提供整数规划模型和最优求解算法，详细描述两种方法并基于标准数据集比较性能，展示如何根据数据特征调优算法。
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.