Upper and lower bounds for the two-level simple plant location problem

DOI10.1023/A:1018942415824MaRDI QIDQ1290136zbMATH OpenOpenAlexFDO

Authors Pierre Chardaire, Jean-Luc Lutton, Alain Sutter

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

zbMATH Keywords

simulated annealinglower boundsLagrangian relaxationlinear programming relaxationssimple plant locationtwo-level concentrator access network

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• New valid inequalities and facets for the simple plant location problem
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• Fast bounding procedures for large instances of the simple plant location problem
• A Lagrangean dual ascent algorithm for simple plant location problems
• A note on duality gap in the simple plant location problem
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• New variants of the simple plant location problem and applications
• scientific article; zbMATH DE number 2032354

Cited in

(21)

• Survivability in hierarchical telecommunications networks
• Combining very large scale and ILP based neighborhoods for a two-level location problem
• Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
• Star \(p\)-hub median problem with modular arc capacities
• Facility location models for distribution system design
• New facets for the two-stage uncapacitated facility location polytope
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
• 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
• A mixed-integer approach to Core-Edge design of storage area networks
• The vendor location problem
• Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints
• Optimisation of the interconnecting network of a UMTS radio mobile telephone system
• A review of hierarchical facility location models
• Multi-level facility location problems
• Exactly solving a two-level location problem with modular node capacities
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• An effective hybrid approach to the two-stage capacitated facility location problem
• Logistics distribution centers location problem and algorithm under fuzzy environment
• scientific article; zbMATH DE number 1264408 (Why is no real title available?)
• Lower and upper bounds for a two-level hierarchical location problem in computer networks

This page was built for publication: Upper and lower bounds for the two-level simple plant location problem

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