A branch and cut algorithm for hub location problems with single assignment

Authors:
Martine Labbé;Hande Yaman;Eric Gourdin
Affiliations:
Université Libre de Bruxelles, Service d’Optimisation, Boulevard du Triomphe CP 210/01, 1050, Bruxelles, Belgium;Bilkent University, Department of Industrial Engineering, Boulevard du Triomphe CP 210/01, 06800, Bilkent, Ankara, Turkey;France Telecom R&D, DAC/OAT, Department of Industrial Engineering, 38-40, rue du General Leclerc, 92794, Issy-les-Moulineaux Cedex 9, Ankara, France
Venue:
Mathematical Programming: Series A and B
Year:
2005

Citing 0
Cited 18

Solving the hub location problem with modular link capacities

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Polyhedral Analysis for Concentrator Location Problems

Computational Optimization and Applications
Star p-hub median problem with modular arc capacities

Computers and Operations Research
A ring-mesh topology design problem for optical transport networks

Journal of Heuristics
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems

Discrete Applied Mathematics
Multiple allocation hub-and-spoke network design under hub congestion

Computers and Operations Research
A conditional p-hub location problem with attraction functions

Computers and Operations Research
Solving the hub location problem with modular link capacities

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

INFORMS Journal on Computing
Single allocation hub location problem under congestion: Network owner and user perspectives

Expert Systems with Applications: An International Journal
Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Star p-hub center problem and star p-hub median problem with bounded path lengths

Computers and Operations Research
Twenty-Five Years of Hub Location Research

Transportation Science
A study of the quadratic semi-assignment polytope

Discrete Optimization
Release Time Scheduling and Hub Location for Next-Day Delivery

Operations Research
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels

Transportation Science
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.