Local and Variable Neighborhood Searches for Solving the Capacitated Clustering Problem-Reference-Cited by-同舟云学术

Local and Variable Neighborhood Searches for Solving the Capacitated Clustering Problem

Published:2017 Issue: Volume: Page:33-55
ISSN:1931-6828
Container-title:Optimization Methods and Applications
language:
Short-container-title:

Author:

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

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-68640-0_3

Reference16 articles.

1. Brimberg, J., Hansen, P., Mladenović, N.: Attraction probabilities in variable neighborhood search. 4OR: Q. J. Oper. Res. 8, 181–194 (2010)

2. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: Nested variable neighborhood search. In: SYM–OP–IS XLII International Symposium on Operations Research (2015)

3. Brimberg, J., Janićijević, S., Mladenović, N., Urošević, D.: Solving the clique partitioning problem as a maximally diverse grouping problem. Optim. Lett. 11, 1–13 (2015)

4. Brimberg, J., Mladenović, N., Urošević, D.: Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf. Sci. 295, 650–675 (2015)

5. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: Solving the capacitated clustering problem with variable neighborhood search. Ann. Oper. Res. doi: https://doi.org/10.1007/s10479-017-2601-5 . Published online August 2017

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

1. Sustainable Zoning, Land-Use Allocation and Facility Location Optimisation in Smart Cities;Energies;2019-04-05