Construction and improvement algorithms for dispersion problems

DOI10.1016/J.EJOR.2014.09.058MaRDI QIDQ726217zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximation algorithms for dispersion problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• The equitable dispersion problem
• Exact algorithms for the max-min dispersion problem
• scientific article; zbMATH DE number 36716

Cites work

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

Cited in

(13)

• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• scientific article; zbMATH DE number 3248144 (Why is no real title available?)
• Measuring diversity. A review and an empirical analysis
• The balanced maximally diverse grouping problem with block constraints
• GRASP and path relinking for the equitable dispersion problem
• The conditional \(p\)-dispersion problem
• Tabu search guided by reinforcement learning for the max-mean dispersion problem
• A review on discrete diversity and dispersion maximization from an OR perspective
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• Maximizing single attribute diversity in group selection
• 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

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726217)