Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks

DOI10.1016/J.ENDM.2006.08.051MaRDI QIDQ3439525zbMATH OpenOpenAlexFDO

Authors M. Iwasa, Hiroo Saito, Tomomi Matsui

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.08.051

zbMATH Keywords

approximation algorithmmetric labelingrandomized roundingsingle allocation

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Cites work

• Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
• The single allocation problem in the interacting three-hub network

Cited in

(2)

• Multiple allocation hub-and-spoke network design under hub congestion
• Characterization of Lee-Yang polynomials

This page was built for publication: Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439525)