An approach for solving competitive location problems with variable demand using multicore systems
From MaRDI portal
Publication:2448138
DOI10.1007/s11590-012-0596-zzbMath1293.90037OpenAlexW1997753979MaRDI QIDQ2448138
José-Jesús Fernández, Pilar M. Ortigosa, Aránzazu Gila Arrondo, Juana L. Redondo
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0596-z
continuous locationparallel algorithmsevolutionary algorithmWeiszfeld algorithmvariable demand\texttt{OpenMP}
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimizing facility location and design ⋮ An efficient approach for solving the HP protein folding problem based on UEGO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a huff-like competitive location and design model for profit maximization in the plane
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- A parallel interior point method and its application to facility location problems
- Solving the multiple competitive facilities location problem
- The parallel variable neighborhood search for the \(p\)-median problem
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Parallel algorithms for continuous competitive location problems
- Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
