Less is more: Basic variable neighborhood search for minimum differential dispersion problem-Reference-Cited by-同舟云学术

Less is more: Basic variable neighborhood search for minimum differential dispersion problem

Published:2016-01 Issue: Volume:326 Page:160-171
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

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

Funder

Ministry of Education and Science, Republic of Kazakhstan

Ministry of Education, Science and Technological Development of Serbia

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference27 articles.

1. Maximum diversity/similarity models with extension to part grouping;Adil;Int. Trans. Operational Res.,2005

2. Solving the maximally diverse grouping problem by skewed general variable neighborhood search;Brimberg;Inf. Sci.,2015

3. The knapsack sharing problem;Brown;Operations Res.,1979

4. The sharing problem;Brown;Operations Res.,1979

5. Tabu search and grasp for the maximum diversity problem;Duarte;European J. Operational Res.,2007

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

1. Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic;Computers & Operations Research;2024-07

2. A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times;Computers & Operations Research;2024-07

3. Variable Neighborhood Search-based Resource Allocation for Vehicle-to-Everything Communications;2024 IEEE 27th International Symposium on Real-Time Distributed Computing (ISORC);2024-05-22

4. A parallel variable neighborhood search for α-neighbor facility location problems;Computers & Operations Research;2024-05

5. Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem;International Series in Operations Research & Management Science;2024