Construction and improvement algorithms for dispersion problems-Reference-Cited by-同舟云学术

Construction and improvement algorithms for dispersion problems

Published:2015-04 Issue:1 Volume:242 Page:21-33
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Aringhieri Roberto,Cordone Roberto,Grosso Andrea

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference34 articles.

1. Maximum diversity/similarity models with extension to part grouping;Adil;International Transactions in Operations Research,2005

2. Composing medical crews with equity and efficiency;Aringhieri;Central European Journal of Operations Research,2009

3. Optimal results and tight bounds for the maximum diversity problem;Aringhieri;Foundations of Computing and Decision Sciences,2009

4. Comparing local search metaheuristics for the maximum diversity problem;Aringhieri;Journal of the Operational Research Society,2011

5. Tabu search vs. GRASP for the maximum diversity problem;Aringhieri;4OR: A Quarterly Journal of Operations Research,2008

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Simple Genetic Algorithm for the Maximum Min-Sum Dispersion Problem (Max-MinSum DP) and New Node Similarity-Based Variants;Lecture Notes in Networks and Systems;2024

2. Iterated Greedy;Springer Optimization and Its Applications;2023

3. Constructive and Destructive Methods in Heuristic Search;Springer Optimization and Its Applications;2023

4. Maximizing single attribute diversity in group selection;Annals of Operations Research;2022-05-25

5. A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values;Annals of Operations Research;2022-05-12