Good solutions to discrete noxious location problems via metaheuristics
DOI10.1007/BF02060482zbMATH Open0782.90061MaRDI QIDQ689250FDOQ689250
Authors: Rex K. Kincaid 
Publication date: 20 December 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
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
simulated annealingtabu search\(p\)- dispersion\(p\)-defense-sumnoxious facility locationsemi-greedy heuristic
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Convergence of an annealing algorithm
- Non-negative matrices and Markov chains. 2nd ed
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Tabu Search Applied to the Quadratic Assignment Problem
- The discrete p-dispersion problem
- Comparison Of Four Models For dispersing Facilities
- Title not available (Why is that?)
- Simulated Annealing – An Annotated Bibliography
- The discrete p-maxian location problem
- Location on Tree Networks: P-Centre and n-Dispersion Problems
Cited In (24)
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Iterated greedy for the maximum diversity problem
- 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
- A review on discrete diversity and dispersion maximization from an OR perspective
- Heuristic solution approaches for the maximum minsum dispersion problem
- Formulations and valid inequalities for the capacitated dispersion problem
- 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
- 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
- A hybrid metaheuristic method for the maximum diversity problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Metaheuristics: A bibliography
- 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)
