Heuristics for minimizing the maximum within-clusters distance-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Heuristics for minimizing the maximum within-clusters distance

Published:2012-11-30 Issue:3 Volume:32 Page:497-522
ISSN:1678-5142
Container-title:Pesquisa Operacional
language:
Short-container-title:Pesqui. Oper.

Author:

Fioruci José Augusto¹,Toledo Franklina M.B.¹,Nascimento Mariá Cristina V.²

Affiliation:

1. Universidade de São Paulo, Brasil

2. Universidade Federal de São Paulo, Brasil

Publisher

FapUNIFESP (SciELO)

Subject

Management Science and Operations Research

Link

http://www.scielo.br/pdf/pope/v32n3/aop2112.pdf

Reference28 articles.

1. Pattern recognition with fuzzy objective function algorithms;BEZDEK JC,1981

2. Mining market data: A network approach;BOGINSKI V;Computers & Operations Research,2006

3. Branch and Bound applications in combinatorial data analysis;BRUSCO MJ,2005

4. A GRASP algorithm for clustering;CANO J;Lecture Notes in Computer Science Springer,2002

5. Comparing community structure identification. Statistical mechanics;DANON L,2005

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

1. A sampling-based exact algorithm for the solution of the minimax diameter clustering problem;Journal of Global Optimization;2018-03-26

2. New hybrid heuristic algorithm for the clustered traveling salesman problem;Computers & Industrial Engineering;2018-02

3. A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM;Pesquisa Operacional;2016-04

4. Optimal design of an IP/MPLS over DWDM network;Pesquisa Operacional;2014-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP