On the Quadratic Programming Approach for Hub Location Problems

Xiaozheng He (), Anthony Chen (), Wanpracha Art Chaovalitwongse () and Henry Liu ()
Additional contact information
Xiaozheng He: University of Minnesota
Anthony Chen: Utah State University
Wanpracha Art Chaovalitwongse: Rutgers University
Henry Liu: University of Minnesota

A chapter in Optimization and Logistics Challenges in the Enterprise, 2009, pp 211-228 from Springer

Abstract: Summary 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 program. 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.

Keywords: Linearization Technique; Access Node; Transit Node; Quadratic Program Approach; Original Quadratic Programming (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-88617-6_7

Ordering information: This item can be ordered from
http://www.springer.com/9780387886176

DOI: 10.1007/978-0-387-88617-6_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().