A hybrid heuristic for the maximum dispersion problem
type: Item
instance of: scholarly article
title: A hybrid heuristic for the maximum dispersion problem
zbMATH Open document ID: 1487.90619
author: Alex Gliesch
author: Marcus Ritt
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354011
zbMATH Keywords: heuristics
zbMATH Keywords: dispersion problem
zbMATH Keywords: ejection chain
zbMATH Keywords: branch-and-bound algorithm
describes a project that uses: final exam scheduling
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.06.011
OpenAlex ID: W3036821521
cites work: Q4656640
cites work: Districting for Arc Routing
cites work: Some Theorems on Abstract Graphs
cites work: The discrete p-dispersion problem
cites work: A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
cites work: Maximal Flow Through a Network
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: Using tabu search techniques for graph coloring
cites work: Q3205262
cites work: Iterated maxima search for the maximally diverse grouping problem
cites work: Dynamic design of sales territories
cites work: A wide-ranging computational comparison of high-performance graph colouring algorithms
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Solving capacitated clustering problems
cites work: The equitable dispersion problem
cites work: An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
cites work: Towards objective measures of algorithm performance across instance space
DOI: 10.1016/J.EJOR.2020.06.011
Recommended article: A Heuristic for Solving the Maximum Dispersion Problem
Recommended article: Heuristic solution approaches for the maximum minsum dispersion problem
Recommended article: Q4887837
Recommended article: A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem
Recommended article: Heuristics for the capacitated dispersion problem
Recommended article: Heuristic and Special Case Algorithms for Dispersion Problems
Recommended article: A hybrid three-phase approach for the Max-Mean dispersion problem
Recommended article: Hybrid heuristics for the maximum diversity problem
Recommended article: Exact algorithms for the max-min dispersion problem
description: scientific article; zbMATH DE number 7354011