On the quadratic programming approach for hub location problems

Xiaozheng He, Anthony Chen, Wanpracha Art Chaovalitwongse, Henry Liu

Research output: Chapter in book / Conference proceedingChapter in an edited book (as author)Academic researchpeer-review

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
Pages211-228
Number of pages18
DOIs
Publication statusPublished - 1 Jan 2009
Externally publishedYes

Publication series

NameSpringer Optimization and Its Applications
Volume30
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization

Cite this