Effective metaheuristic algorithms for the minimum differential dispersion problem
From MaRDI portal
Recommendations
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- Tabu search and GRASP for the maximum diversity problem
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A heuristic approach for the max-min diversity problem based on max-clique
- A note on hashing functions and tabu search algorithms
- A review on algorithms for maximum clique problems
- A simple and effective algorithm for the MaxMin diversity problem
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- A user's guide to tabu search
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- GRASP and path relinking for the equitable dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Good solutions to discrete noxious location problems via metaheuristics
- Hashing vectors for tabu search
- Heuristic algorithms for the maximum diversity problem
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Path relinking for unconstrained binary quadratic programming
- TTT plots: a perl program to create time-to-target plots
- Tabu search and GRASP for the maximum diversity problem
- The Knapsack Sharing Problem
- The Sharing Problem
- The discrete p-dispersion problem
- The equitable dispersion problem
- The quadratic balanced optimization problem
Cited in
(17)- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Discrete Diversity and Dispersion Maximization
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- Solution-based versus attribute-based tabu search for binary integer programming
- Learning tabu search algorithms: a scheduling application
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- The balanced maximally diverse grouping problem with block constraints
- A vertex weighting-based double-tabu search algorithm for the classical p-center problem
- Frequent pattern mining driven evolutionary search for cross-dock door assignment
- Bi-objective optimization of biclustering with binary data
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
This page was built for publication: Effective metaheuristic algorithms for the minimum differential dispersion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751715)
