A polynomial algorithm for balanced clustering via graph partitioning-Reference-Cited by-同舟云学术

A polynomial algorithm for balanced clustering via graph partitioning

Published:2021-03 Issue:2 Volume:289 Page:456-469
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Caraballo Luis Evaristo,Díaz-Báñez José-Miguel^ORCID,Kroher Nadine^ORCID

Funder

Horizon 2020

Publisher

Elsevier BV

Subject

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

Reference25 articles.

1. Wireless sensor networks: a survey;Akyildiz;Computer networks,2002

2. Clustering algorithms based on minimum and maximum spanning trees;Asano,1988

3. On the complexity of clustering problems;Brucker,1978

4. The block-information-sharing strategy for task allocation: A case study for structure assembly with aerial robots;Caraballo;European Journal of Operational Research,2017

5. “ratio regions”: a technique for image segmentation;Cox,1996

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

1. Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms;Applied Soft Computing;2024-11

2. Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing;European Journal of Operational Research;2024-02

3. CAPKM++2.0: An upgraded version of the collaborative annealing power k-means++ clustering algorithm;Knowledge-Based Systems;2023-02

4. Solving Continuous Quadratic Programming for the Discrete Balanced Graph Partitioning Problem by Using Simulated Annealing Algorithm Hybridized Localsearch and Multi Start Algorithms;2023

5. Balanced clustering based on collaborative neurodynamic optimization;Knowledge-Based Systems;2022-08