Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference40 articles.
1. DIMACS Implementation Challenge: The Traveling Salesman Problem, available at http://www.research.att.com/~dsj/chtsp/
2. L. Brunetta, M. Conforti and N. Rinaldi, A branch-and-cut algorithm for the equicut problem, Mathematical Programming 78 (1997) 243–263.
3. T.N. Bui and B.R. Moon, Genetic algorithm and graph partitioning, IEEE Transactions on Computers 45(7) (1996) 87–101.
4. P.P. Chakrabarti, S. Ghose, A. Acharya and S.C. de Sarkar, Heuristic search in restricted memory, Artificial Intelligence 41(2) (1989) 197–221.
5. J. Clausen and J. Larsson-Traff, Implementation of parallel branch and bound algorithms – Experiences with the graph partitioning problem, Annals of Operation Research 33 (1991) 331–349.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Statistical Inference for Spatial Regionalization;Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems;2023-11-13
2. A Scalable Unified System for Seeding Regionalization Queries;Proceedings of the 18th International Symposium on Spatial and Temporal Data;2023-08-23
3. Enhanced Approach for Agglomerative Clustering Using Topological Relations;IEEE Access;2023
4. Personalized Graph Summarization: Formulation, Scalable Algorithms, and Applications;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
5. ILP-Based Local Search for Graph Partitioning;ACM Journal of Experimental Algorithmics;2020-12-06