Construction and improvement algorithms for dispersion problems
type: Item
instance of: scholarly article
title: Construction and improvement algorithms for dispersion problems
zbMATH Open document ID: 1341.90105
author: Roberto Aringhieri
author: Roberto Cordone
author: Andrea Grosso
published in: European Journal of Operational Research
publication date: 2016-07-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6602323
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dispersion problems
zbMATH Keywords: binary quadratic programming
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2014.09.058
OpenAlex ID: W2079015195
cites work: Maximum diversity/similarity models with extension to part grouping
cites work: Composing medical crews with equity and efficiency
cites work: Q3070929
cites work: Tabu search versus GRASP for the maximum diversity problem
cites work: Variable neighborhood search for the heaviest \(k\)-subgraph
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: Analytical models for locating undesirable facilities
cites work: Comparison Of Four Models For dispersing Facilities
cites work: Hybrid heuristics for the maximum diversity problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Heuristic algorithms for the maximum diversity problem
cites work: Q4354785
cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem
cites work: Variable Neighborhood Search
cites work: A branch and bound algorithm for the maximum diversity problem
cites work: GRASP and path relinking for the equitable dispersion problem
cites work: Iterated tabu search for the maximum diversity problem
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: A simple and effective algorithm for the MaxMin diversity problem
cites work: The equitable dispersion problem
cites work: GRASP and path relinking for the max-min diversity problem
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
cites work: A hybrid metaheuristic method for the maximum diversity problem
DOI: 10.1016/J.EJOR.2014.09.058
description: scientific article; zbMATH DE number 6602323