Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane

Authors:
Ryuta Ando;Tomomi Matsui
Affiliations:
Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University, Tokyo, Japan;Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University, Tokyo, Japan
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 9
Cited 0

A tight linearization and an algorithm for zero-one quadratic programming problems

Management Science
Perspectives of Monge properties in optimization

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

Mathematical Programming: Series A and B
Projecting the flow variables for hub location problems

Networks
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem

SIAM Journal on Discrete Mathematics
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems

Discrete Applied Mathematics
A study of the quadratic semi-assignment polytope

Discrete Optimization
On dependent randomized rounding algorithms

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with a single allocation problem in hub-and-spoke networks. We handle the case that all the nodes are embedded in a 2-dimensional plane and a transportation cost (per unit flow) is proportional to Euclidean distance. We propose a randomized (1+2/π)-approximation algorithm based on a linear relaxation problem and a dependent rounding procedure.