Good solutions to discrete noxious location problems via metaheuristics
From MaRDI portal
(Redirected from Publication:689250)
Recommendations
- Metaheuristic applications on discrete facility location problems: a survey
- Methods for a class of discrete location problems
- scientific article; zbMATH DE number 1696648
- scientific article; zbMATH DE number 1340523
- A flexible model and efficient solution strategies for discrete location problems
- A flexible model and efficient solution strategies for discrete location problems
- scientific article; zbMATH DE number 2050759
- scientific article; zbMATH DE number 4020810
- A perturbation heuristic for a class of location problems
- Generalization of the restricted planar location problems: unified metaheuristic algorithms
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 849075 (Why is no real title available?)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Comparison Of Four Models For dispersing Facilities
- Convergence of an annealing algorithm
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Non-negative matrices and Markov chains. 2nd ed
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Simulated Annealing – An Annotated Bibliography
- Tabu Search Applied to the Quadratic Assignment Problem
- The discrete p-dispersion problem
- The discrete p-maxian location problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(24)- Iterated greedy for the maximum diversity problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Iterated tabu search for the maximum diversity problem
- The Location of Undesirable Facilities
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Measuring diversity. A review and an empirical analysis
- An integer programming approach for solving the p-dispersion problem
- Location and layout planning. A survey
- p-median and p-dispersion problems: a bi-criteria analysis
- The equitable dispersion problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- A review on discrete diversity and dispersion maximization from an OR perspective
- A simple and effective algorithm for the MaxMin diversity problem
- Integer-friendly formulations for the \(r\)-separation problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Formulations and valid inequalities for the capacitated dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- On solving the densest \(k\)-subgraph problem on large graphs
- A comparison of \(p\)-dispersion heuristics
- Metaheuristics: A bibliography
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- A hybrid metaheuristic method for the maximum diversity problem
- Transmitter location for maximum coverage and constructive-destructive interference management
This page was built for publication: Good solutions to discrete noxious location problems via metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689250)
