Effective metaheuristic algorithms for the minimum differential dispersion problem
type: Item
instance of: scholarly article
title: Effective metaheuristic algorithms for the minimum differential dispersion problem
zbMATH Open document ID: 1394.90584
author: Yang Wang
author: Qinghua Wu
author: Fred Glover
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6873547
zbMATH Keywords: metaheuristics
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dispersion problems
zbMATH Keywords: tabu search
zbMATH Keywords: memetic search
describes a project that uses: PERL
describes a project that uses: Tabu search
describes a project that uses: TTTPLOTS
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.035
OpenAlex ID: W2535423790
cites work: TTT plots: a perl program to create time-to-target plots
cites work: The Knapsack Sharing Problem
cites work: The Sharing Problem
cites work: A note on hashing functions and tabu search algorithms
cites work: Location on Tree Networks: P-Centre and n-Dispersion Problems
cites work: A heuristic approach for the max-min diversity problem based on max-clique
cites work: Tabu search and GRASP for the maximum diversity problem
cites work: The discrete p-dispersion problem
cites work: Heuristic algorithms for the maximum diversity problem
cites work: Q4354785
cites work: A user's guide to tabu search
cites work: Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: GRASP and path relinking for the equitable dispersion problem
cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem
cites work: A simple and effective algorithm for the MaxMin diversity problem
cites work: The equitable dispersion problem
cites work: The quadratic balanced optimization problem
cites work: GRASP and path relinking for the max-min diversity problem
cites work: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
cites work: Path relinking for unconstrained binary quadratic programming
cites work: Hashing vectors for tabu search
cites work: A review on algorithms for maximum clique problems
cites work: A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
DOI: 10.1016/J.EJOR.2016.10.035
description: scientific article; zbMATH DE number 6873547