Optimization Online


A Branch and Cut Algorithm for Hub Location Problems with Single Assignment

Martine Labbé (mlabbe***at***smg.ulb.ac.be)
Hande Yaman (hyaman***at***smg.ulb.ac.be)
Eric Gourdin (eric.gourdin***at***rd.francetelecom.com)

Abstract: The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.

Keywords: hub location, polyhedral analysis, branch and cut

Category 1: Combinatorial Optimization (Branch and Cut Algorithms )

Category 2: Combinatorial Optimization (Polyhedra )

Category 3: Applications -- OR and Management Sciences (Telecommunications )

Citation: Mathematical Programming, Vol. 102, 371-405, 2005.


Entry Submitted: 04/30/2003
Entry Accepted: 04/30/2003
Entry Last Modified: 06/21/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society