A hybrid heuristic for the maximum dispersion problem

DOI10.1016/j.ejor.2020.06.011zbMath1487.90619OpenAlexW3036821521MaRDI QIDQ2028755

Marcus Ritt, Alex Gliesch

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.011

zbMATH Keywords

branch-and-bound algorithmheuristicsdispersion problemejection chain

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Uses Software

• irace
• final exam scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Iterated maxima search for the maximally diverse grouping problem
• Towards objective measures of algorithm performance across instance space
• Dynamic design of sales territories
• Using tabu search techniques for graph coloring
• Solving capacitated clustering problems
• The discrete p-dispersion problem
• The equitable dispersion problem
• An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Districting for Arc Routing
• Maximal Flow Through a Network
• A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Some Theorems on Abstract Graphs