Variable neighborhood search for minimum sum-of-squares clustering on networks
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2013.04.027
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
- Yong-Yeol Ahn & James P. Bagrow & Sune Lehmann, 2010. "Link communities reveal multiscale complexity in networks," Nature, Nature, vol. 466(7307), pages 761-764, August.
- Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
- Beasley, J. E., 1985. "A note on solving large p-median problems," European Journal of Operational Research, Elsevier, vol. 21(2), pages 270-273, August.
- Pierre Hansen & Eric Ngai & Bernard K. Cheung & Nenad Mladenovic, 2005. "Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering," Journal of Classification, Springer;The Classification Society, vol. 22(2), pages 287-310, September.
- labbe, M. & Peeters, D. & Thisse, J.F., 1992.
"Location on Networks,"
Papers
9216, Universite Libre de Bruxelles - C.E.M.E..
- LABBE, Martine & PEETERS, Dominique & THISSE, Jacques-François, 1993. "Location on Networks," LIDAM Discussion Papers CORE 1993040, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
- Nascimento, Mariá C.V. & de Carvalho, André C.P.L.F., 2011. "Spectral methods for graph clustering - A survey," European Journal of Operational Research, Elsevier, vol. 211(2), pages 221-231, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Zhu, Shan & Hu, Xiangpei & Huang, Kai & Yuan, Yufei, 2021. "Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders," European Journal of Operational Research, Elsevier, vol. 290(2), pages 556-571.
- Dušan Džamić & Daniel Aloise & Nenad Mladenović, 2019. "Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization," Annals of Operations Research, Springer, vol. 272(1), pages 273-287, January.
- Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
- Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.
- Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
- Todosijević, Raca & Benmansour, Rachid & Hanafi, Saïd & Mladenović, Nenad & Artiba, Abdelhakim, 2016. "Nested general variable neighborhood search for the periodic maintenance problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 385-396.
- Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
- Emilio Carrizosa & Vanesa Guerrero & Dolores Romero Morales, 2023. "On mathematical optimization for clustering categories in contingency tables," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(2), pages 407-429, June.
- Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
- Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
- Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
- Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
- Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
- Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
- Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
- Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
- Sáez-Aguado, Jesús & Trandafir, Paula Camelia, 2012. "Some heuristic methods for solving p-median problems with a coverage constraint," European Journal of Operational Research, Elsevier, vol. 220(2), pages 320-327.
- Alcaraz, Javier & Landete, Mercedes & Monge, Juan F., 2012. "Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 54-64.
- Bader F. AlBdaiwi & Diptesh Ghosh & Boris Goldengorin, 2011. "Data aggregation for p-median problems," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 348-363, April.
- Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
- Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
- Olender, Paweł & Ogryczak, Włodzimierz, 2019. "A revised Variable Neighborhood Search for the Discrete Ordered Median Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 445-465.
- de Palma, André & Lindsey, Robin, 2001.
"Optimal timetables for public transportation,"
Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 789-813, September.
- A. de Palma & R. Lindsey, 2000. "Optimal Timetables for Public Transportation," THEMA Working Papers 2000-09, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
- S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
- Amiri, Babak & Karimianghadim, Ramin, 2024. "A novel text clustering model based on topic modelling and social network analysis," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
- Jo, Hang-Hyun & Moon, Eunyoung, 2016. "Dynamical complexity in the perception-based network formation model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 282-292.
- Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
More about this item
Keywords
Minimum sum-of-squares clustering; Location on networks; Variable neighborhood search;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:230:y:2013:i:2:p:356-363. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.