A FAST ALGORITHM FOR THE GREEDY INTERCHANGE FOR LARGE-SCALE CLUSTERING AND MEDIAN LOCATION-PROBLEMS

被引：0
|
作者：
WHITAKER, RA
机构：
来源：
INFOR | 1983年 / 21卷 / 02期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：95 / 108
页数：14
相关论文
共 50 条
  • [1] SOME INTERCHANGE ALGORITHMS FOR MEDIAN LOCATION-PROBLEMS
    WHITAKER, RA
    ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1982, 9 (02): : 119 - 129
  • [2] Genetic Algorithm with Fast Greedy Heuristic for Clustering and Location Problems
    Kazakovtsev, Lev A.
    Antamoshkin, Alexander N.
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2014, 38 (03): : 229 - 240
  • [3] ON THE EXACT SOLUTION OF LARGE-SCALE SIMPLE PLANT LOCATION-PROBLEMS
    KORKEL, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 39 (02) : 157 - 173
  • [4] APPROXIMATE SOLUTIONS TO LARGE-SCALE CAPACITATED FACILITY LOCATION-PROBLEMS
    SHETTY, B
    APPLIED MATHEMATICS AND COMPUTATION, 1990, 39 (02) : 159 - 175
  • [5] A FAST METHOD FOR LARGE-SCALE MULTICHROMOSOMAL BREAKPOINT MEDIAN PROBLEMS
    Boyd, Sylvia
    Haghighi, Maryam
    JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2012, 10 (01)
  • [6] AN ALGORITHM FOR SOLVING LARGE CAPACITATED WAREHOUSE LOCATION-PROBLEMS
    BEASLEY, JE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 33 (03) : 314 - 325
  • [7] Fast algorithm for large-scale subspace clustering by LRR
    Xie, Deyan
    Nie, Feiping
    Gao, Quanxue
    Xiao, Song
    IET IMAGE PROCESSING, 2020, 14 (08) : 1475 - 1480
  • [8] A fast fuzzy clustering algorithm for large-scale datasets
    Shi, LK
    He, PL
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2005, 3584 : 203 - 208
  • [9] A DISCRETIZING ALGORITHM FOR LOCATION-PROBLEMS
    CARRIZOSA, EJ
    PUERTO, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (01) : 166 - 174
  • [10] Greedy Squirrel Search Algorithm for Large-Scale Traveling Salesman Problems
    Shi, Chenghao
    Tang, Zhonghua
    Zhou, Yongquan
    Luo, Qifang
    INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 830 - 845
12345