Upper and lower bounds for the two-level simple plant location problem
From MaRDI portal
Publication:1290136
DOI10.1023/A:1018942415824zbMath0918.90095OpenAlexW1593849271MaRDI QIDQ1290136
Pierre Chardaire, Alain Sutter, Jean-Luc Lutton
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018942415824
Lagrangian relaxationsimulated annealinglower boundslinear programming relaxationssimple plant locationtwo-level concentrator access network
Related Items (19)
Survivability in hierarchical telecommunications networks ⋮ Exactly solving a two-level location problem with modular node capacities ⋮ Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A review of hierarchical facility location models ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Multi-level facility location problems ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ The vendor location problem ⋮ Facility location models for distribution system design ⋮ Tactical design of rail freight networks. I: Exact and heuristic methods ⋮ A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro ⋮ Optimisation of the interconnecting network of a UMTS radio mobile telephone system ⋮ Combining very large scale and ILP based neighborhoods for a two-level location problem
This page was built for publication: Upper and lower bounds for the two-level simple plant location problem
