Solving the maximum min-sum dispersion by alternating formulations of two different problems-Reference-Cited by-同舟云学术

Solving the maximum min-sum dispersion by alternating formulations of two different problems

Published:2017-07 Issue:2 Volume:260 Page:444-459
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Amirgaliyeva Zhazira,Mladenović Nenad,Todosijević Raca,Urošević Dragan

Publisher

Elsevier BV

Subject

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

Reference39 articles.

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

2. Construction and improvement algorithms for dispersion problems;Aringhieri;European Journal of Operational Research,2015

3. Tabu search versus grasp for the maximum diversity problem;Aringhieri;4OR,2008

4. Solving the maximally diverse grouping problem by skewed general variable neighborhood search;Brimberg;Information Sciences,2015

5. Variable neighbourhood search for the heaviest k-subgraph;Brimberg;Computers and Operations Research,2009

Cited by 24 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. Variable Neighborhood Search;Springer Optimization and Its Applications;2023

3. A Multi-Start Biased-Randomized Algorithm for the Capacitated Dispersion Problem;Mathematics;2022-07-09

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