Less is more: Solving the Max-Mean diversity problem with variable neighborhood search-Reference-Cited by-同舟云学术

Less is more: Solving the Max-Mean diversity problem with variable neighborhood search

Published:2017-03 Issue: Volume:382-383 Page:179-200
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

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

Funder

RSF

Natural Sciences and Engineering Research Council of Canada

Publisher

Elsevier BV

Subject

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

Reference21 articles.

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

2. The knapsack sharing problem;Brown;Oper. Res.,1979

3. The sharing problem;Brown;Oper. Res.,1979

4. R. Carrasco, A.P. Trinh, M. Galego, F. Gortazar, R. Marti, A. Duarte, Tabu search for the max-mean dispersion problem, Knowledge–Based Systems (in press).

5. The discrete p-dispersion problem;Erkut;Eur. J. Oper. Res.,1990

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

1. A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem;Mathematics;2024-03-20

2. A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem;IEEE Transactions on Emerging Topics in Computational Intelligence;2024

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

4. A trajectory based heuristic for the planar p-median problem;Computers & Operations Research;2023-10

5. The Obnoxious Competitive Facility Location Model;Networks and Spatial Economics;2023-10-01