A robust and efficient algorithm for planar competitive location problems
From MaRDI portal
Recommendations
- Parallel algorithms for continuous competitive location problems
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Finding the optimal solution to the Huff based competitive location model
- An improved branch \& bound method for the uncapacitated competitive location problem
- Branch-and-bound algorithm for a competitive facility location problem
Cites work
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- A d.c. optimization method for single facility location problems
- Analytical models for locating undesirable facilities
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
- Finding the optimal solution to the Huff based competitive location model
- GBSSS: The generalized big square small square method for planar single- facility location
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- Minimization by Random Search Techniques
- On the use of genetic algorithms to solve location problems
- Optimization by simulated annealing
- PROFIL/BIAS - A fast interval library
- Reliability and performance of UEGO, a clustering-based global optimizer
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Solving the multiple competitive facilities location problem
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- Variable neighborhood search: Principles and applications
Cited in
(13)- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- An efficient approach for solving the HP protein folding problem based on UEGO
- Finding the optimal solution to the Huff based competitive location model
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- Parallel algorithms for continuous competitive location problems
- Competitive query strategies for minimising the ply of the potential locations of moving points
- scientific article; zbMATH DE number 7083281 (Why is no real title available?)
- Two- and three-dimensional modeling and optimization applied to the design of a fast hydrodynamic focusing microfluidic mixer for protein folding
- Conditional Location Problems on Networks and in the Plane
- On solving unreliable planar location problems
This page was built for publication: A robust and efficient algorithm for planar competitive location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026588)
