首页> 外文会议>IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future >A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane

【24h】

A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane

机译：一种启发式算法，用于在平面上从给定的3种彩色点找到最近的三彩点的三彩点

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

NA

机译：在

著录项

来源
《IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future》|2011年||共4页
会议地点
作者
Nguyen Trung N.; Duong Duc A.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 TN91-53;
关键词

相似文献

外文文献
中文文献
专利

1. A Better Heuristic Algorithm for Finding the Closest Trio of 3-colored Points from a Given Set of 3-colored Points on a Plane [J] . Ngoc Trung Nguyen, Anh-Duc Duong Fundamenta Informaticae . 2014,第2期

机译：一种从平面上给定的三色点集中找到最接近的三色点三重奏的启发式算法
2. Balanced partitions of 3-colored geometric sets in the plane [J] . Bereg Sergey, Hurtado Ferran, Kano Mikio, Discrete Applied Mathematics . 2015,第Null期

机译：平面中三色几何集的平衡分区
3. Time-Optimal Heuristic Algorithms for Finding Closest-Pair of Points in 2D and 3D [J] . Mashilamani Sambasivam Computer Science & Information Technology . 2015,第12期

机译：在2D和3D中找到最接近的点对的时间最优启发式算法
4. A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane [C] . Nguyen Trung N., Duong Duc A. Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2012 IEEE RIVF International Conference on . 2012

机译：一种从平面上给定的三色点集中找到最接近的三色点三重奏的启发式算法
5. Finding a Minimum-Width Trounulus Covering a Set of Points on the Plane [D] . Alwabsi, Nowayer Afnan H. 2017

机译：找到一个最小宽度小管，覆盖飞机上一组点
6. Rarity-Weighted Richness: A Simple and Reliable Alternative to Integer Programming and Heuristic Algorithms for Minimum Set and Maximum Coverage Problems in Conservation Planning [O] . Fabio Albuquerque, Paul Beier -1

机译：稀有加权丰富度：保护规划中最小集和最大覆盖率问题的整数规划和启发式算法的简单可靠的替代方案
7. Balanced partitions of 3-colored geometric sets in the plane [O] . Bereg, Sergey, Korman, Matias, Silveira, Rodrigo I., 2017

机译：平面中3色几何图形的平衡分区
8. Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study. [R] . Balas, E., Ho, A. 1979

机译：使用切割平面，启发式和次梯度优化设置覆盖算法：计算研究。

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号