Construction and improvement algorithms for dispersion problems

DOI10.1016/j.ejor.2014.09.058zbMath1341.90105OpenAlexW2079015195MaRDI QIDQ726217

Roberto Aringhieri, Roberto Cordone, Andrea Grosso

Publication date: 8 July 2016

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

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

zbMATH Keywords

combinatorial optimizationtabu searchbinary quadratic programmingdispersion problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (9)

A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Maximizing single attribute diversity in group selection ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• Composing medical crews with equity and efficiency
• A simple and effective algorithm for the MaxMin diversity problem
• Tabu search and GRASP for the maximum diversity problem
• The discrete p-dispersion problem
• Tabu search versus GRASP for the maximum diversity problem
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• Variable neighborhood search for the heaviest \(k\)-subgraph
• GRASP and path relinking for the max-min diversity problem
• Analytical models for locating undesirable facilities
• Future paths for integer programming and links to artificial intelligence
• A hybrid metaheuristic method for the maximum diversity problem
• A branch and bound algorithm for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Hybrid heuristics for the maximum diversity problem
• Maximum diversity/similarity models with extension to part grouping
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Comparison Of Four Models For dispersing Facilities
• Heuristic algorithms for the maximum diversity problem
• Variable Neighborhood Search
• A Tabu Search Heuristic for the Vehicle Routing Problem

This page was built for publication: Construction and improvement algorithms for dispersion problems