TY - CHAP
T1 - On the quadratic programming approach for hub location problems
AU - He, Xiaozheng
AU - Chen, Anthony
AU - Chaovalitwongse, Wanpracha Art
AU - Liu, Henry
PY - 2009/1/1
Y1 - 2009/1/1
N2 - Hub networks play an important role in many real-life network systems such as transportation and telecommunication networks. Hub location problem is concerned with identifying appropriate hub locations in a network and connecting an efficient hub-and-spoke network that minimizes the flow-weighted costs across the network. This chapter is focused on the uncapacitated single allocation p-hub median problem (USApHMP), which arises in many real-world hub networks of logistics operations. There have been many approaches used to solve this problem. We herein focus on a quadratic programming approach, which has been proven very effective and efficient. This approach incorporates the use of the linearization for 0-1 quadratic programs. In this chapter, we give a brief review of the linearization techniques for 0-1 quadratic programs and compare the performance of several existing linearization techniques for USApHMP. Toward the end, we discuss some properties, comments and possible developments of these linearization techniques in the real-life USApHMP.
AB - Hub networks play an important role in many real-life network systems such as transportation and telecommunication networks. Hub location problem is concerned with identifying appropriate hub locations in a network and connecting an efficient hub-and-spoke network that minimizes the flow-weighted costs across the network. This chapter is focused on the uncapacitated single allocation p-hub median problem (USApHMP), which arises in many real-world hub networks of logistics operations. There have been many approaches used to solve this problem. We herein focus on a quadratic programming approach, which has been proven very effective and efficient. This approach incorporates the use of the linearization for 0-1 quadratic programs. In this chapter, we give a brief review of the linearization techniques for 0-1 quadratic programs and compare the performance of several existing linearization techniques for USApHMP. Toward the end, we discuss some properties, comments and possible developments of these linearization techniques in the real-life USApHMP.
UR - http://www.scopus.com/inward/record.url?scp=84976462889&partnerID=8YFLogxK
U2 - 10.1007/978-0-387-88617-6_7
DO - 10.1007/978-0-387-88617-6_7
M3 - Chapter in an edited book (as author)
T3 - Springer Optimization and Its Applications
SP - 211
EP - 228
BT - Springer Optimization and Its Applications
ER -