A Heuristic Algorithm for Solving Triangle Packing Problem
The research on the triangle packing problem has important theoretic significance, which has broad application prospects in material processing, network resource optimization, and so forth. Generally speaking, the orientation of the triangle should be limited in advance, since the triangle packing p...
Saved in:
Main Authors: | Ruimin Wang, Yuqiang Luo, Jianqiang Dong, Shuai Liu, Xiaozhuo Qi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2013/686845 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles
by: Ruimin Wang, et al.
Published: (2014-01-01) -
Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
by: PAN Yun1, et al.
Published: (2007-01-01) -
A new approach for bin packing problem using knowledge reuse and improved heuristic
by: Jie Fang, et al.
Published: (2024-12-01) -
The Weighted Fermat Triangle Problem
by: Yujin Shen, et al.
Published: (2008-01-01) -
A Heuristic Algorithm for Resource Allocation/Reallocation Problem
by: S. Raja Balachandar, et al.
Published: (2011-01-01)