Parallel algorithms for continuous competitive location problems
From MaRDI portal
Publication:3605201
Recommendations
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
- A robust and efficient algorithm for planar competitive location problems
- An approach for solving competitive location problems with variable demand using multicore systems
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- Sensitivity analysis of a continuous multifacility competitive location and design problem
Cited in
(11)- A Huff-like location model with quality adjustment and/or closing of existing facilities
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
- scientific article; zbMATH DE number 7083281 (Why is no real title available?)
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- An efficient approach for solving the HP protein folding problem based on UEGO
- Two- and three-dimensional modeling and optimization applied to the design of a fast hydrodynamic focusing microfluidic mixer for protein folding
- An approach for solving competitive location problems with variable demand using multicore systems
- scientific article; zbMATH DE number 1748530 (Why is no real title available?)
- A robust and efficient algorithm for planar competitive location problems
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
This page was built for publication: Parallel algorithms for continuous competitive location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605201)
