A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles
The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to li...
Saved in:
Main Authors: | Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo, Jianqiang Dong |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/308474 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Heuristic Algorithm for Solving Triangle Packing Problem
by: Ruimin Wang, et al.
Published: (2013-01-01) -
The Topological Type of Equilateral and Almost Equiangular Polygon Spaces
by: Yasuhiko Kamiyama
Published: (2019-01-01) -
The Weighted Fermat Triangle Problem
by: Yujin Shen, et al.
Published: (2008-01-01) -
A Chaotic Disturbance Wolf Pack Algorithm for Solving Ultrahigh-Dimensional Complex Functions
by: Qiming Zhu, et al.
Published: (2021-01-01) -
Equilateral Triangular Dielectric Resonator Nantenna at Optical Frequencies for Energy Harvesting
by: Waleed Tariq Sethi, et al.
Published: (2015-01-01)