Solving the hub location problem in a star–star network

Martine Labbé · Hande Yaman

63 citations0/0 files storedNetworks

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

Abstract

Abstract We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals and routing the traffic between hubs and the central node. We present two formulations and show that the constraints are facet‐defining inequalities in both cases. We test the formulations on a set of instances. Finally, we present a heuristic based on Lagrangian relaxation. © 2007 Wiley Periodicals, Inc. NETWORKS, 2008

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 63 citations exist upstream.

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph 1991Discrete location theory 1987A quadratic integer program for the location of interacting hub facilities 1994Integer programming formulations of discrete hub location problems 1996Efficient algorithms for the uncapacitated single allocation p-hub median problem 1983The simple plant location problem: Survey and synthesis 1996Tight linear programming relaxations of uncapacitated p-hub median problems 1993Lagrangean heuristics for location problems

Cited by

2015Exact and heuristic algorithms for the design of hub networks with multiple lines 2010Single-allocation ordered median hub location problems 2017An exact algorithm for the modular hub location problem with single assignments 2017Exact solution of hub network design problems with profits 2019Hub Location Problems 2016Exact and heuristic approaches for the cycle hub location problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.