A hub location problem in designing digital data service networks: Lagrangian relaxation approach

DOI10.1016/S0966-8349(96)00009-5zbMath0929.90050MaRDI QIDQ4228762

Byung Ha Lim, June S. Park, Youngho Lee

Publication date: 18 January 2000

Published in: Location Science (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationSteiner treehub locationnetwork topology designgraph-based model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (11)

Survivability in hierarchical telecommunications networks ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ General network design: a unified view of combined location and network design problems ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Integrated Network Design and Routing: An Application in the Timber Trade Industry ⋮ Perspectives on modeling hub location problems ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ Modeling two-stage UHL problem with uncertain demands ⋮ The tree of hubs location problem

Uses Software

• MINTO

This page was built for publication: A hub location problem in designing digital data service networks: Lagrangian relaxation approach