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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Dynamics in Nature and Society Vol. 2013; no. 2013; pp. 536 - 542-163
Main Authors Wang, Ruiming, Luo, Yuqiang, Dong, Jianqiang, Liu, Shuai, Qi, Xiaozhuo
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Limiteds 01.01.2013
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Hindawi Limited
Subjects
Online AccessGet full text

Cover

Loading…
Abstract 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 problem is NP-hard and has continuous properties. For example, the polygon is not allowed to rotate; then, the approximate solution can be obtained by optimization method. This paper studies the triangle packing problem by a new kind of method. Such concepts as angle region, corner-occupying action, corner-occupying strategy, and edge-conjoining strategy are presented in this paper. In addition, an edge-conjoining and corner-occupying algorithm is designed, which is to obtain an approximate solution. It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.
AbstractList 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 problem is NP-hard and has continuous properties. For example, the polygon is not allowed to rotate; then, the approximate solution can be obtained by optimization method. This paper studies the triangle packing problem by a new kind of method. Such concepts as angle region, corner-occupying action, corner-occupying strategy, and edge-conjoining strategy are presented in this paper. In addition, an edge-conjoining and corner-occupying algorithm is designed, which is to obtain an approximate solution. It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.
Audience Academic
Author Shuai Liu
Xiaozhuo Qi
Yuqiang Luo
Ruimin Wang
Jianqiang Dong
Author_xml – sequence: 1
  fullname: Wang, Ruiming
– sequence: 2
  fullname: Luo, Yuqiang
– sequence: 3
  fullname: Dong, Jianqiang
– sequence: 4
  fullname: Liu, Shuai
– sequence: 5
  fullname: Qi, Xiaozhuo
BookMark eNqFkc9rFTEQxxepYFs9eRYWvIiy7Ux-7cbbo6gtFHxgBW9hXjbZ5rm7qdl9iv-92a5U9CI5JJl85puZ-Z4UR2McXVE8RzhDlPKcAfJz1ahGyEfFMSqoq6apvxzlMzBVAWPqSXEyTXsABo1mx8XbTXnpDilMc7Dlpu9iCvPtUPqYyk-x_x7GrrxJgcaud-WW7NclsE1x17vhafHYUz-5Z7_30-Lz-3c3F5fV9ccPVxeb64qkUnNVay65bFBpko1u21YrjkQNCM9IgGuZxNaDlW6nqNXSA0dtgSQwIQQHflpcrbptpL25S2Gg9NNECuY-EFNnKOXye2dAsXrH0VrwTABryNna2VwH854j-Kz1atW6S_HbwU2zGcJkXd_T6OJhMigZaF5rhhl9-Q-6j4c05k4NilopnicoMnW2Uh3l_8Po45zI5tW6Idjsjg85vhGM5wkIUDnhzZpgU5ym5PxDRwhmMdEsJprVxEy_XunbMLb0I_wHfrHCLiPO0wMsNMhmGeR2faeQXQ5_-tlmFQUaOQC_V0S2bAoRcojVf18kV0YKZlBx_gt0urg0
CitedBy_id crossref_primary_10_1155_2014_308474
Cites_doi 10.1016/0377-2217(95)00021-H
10.1016/j.dam.2010.05.026
10.1016/j.ejor.2012.09.023
10.1016/j.cor.2010.04.008
10.1016/j.cor.2010.08.017
10.1016/j.ejor.2009.03.046
10.1016/j.cor.2010.04.013
ContentType Journal Article
Contributor Luo, Yuqiang
Dong, Jianqiang
Qi, Xiaozhuo
Liu, Shuai
Wang, Ruiming
Contributor_xml – sequence: 1
  fullname: Wang, Ruiming
– sequence: 2
  fullname: Luo, Yuqiang
– sequence: 3
  fullname: Dong, Jianqiang
– sequence: 4
  fullname: Liu, Shuai
– sequence: 5
  fullname: Qi, Xiaozhuo
Copyright Copyright © 2013 Ruimin Wang et al.
COPYRIGHT 2014 John Wiley & Sons, Inc.
Copyright © 2013 Ruimin Wang et al. Ruimin Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright_xml – notice: Copyright © 2013 Ruimin Wang et al.
– notice: COPYRIGHT 2014 John Wiley & Sons, Inc.
– notice: Copyright © 2013 Ruimin Wang et al. Ruimin Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
DBID 188
ADJCN
AHFXO
RHU
RHW
RHX
AAYXX
CITATION
7SC
7TB
8FD
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
CWDGH
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L7M
L~C
L~D
P5Z
P62
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.1155/2013/686845
DatabaseName Airiti Library
الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals
معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete
Hindawi Publishing Complete
Hindawi Publishing Subscription Journals
Open Access Journals (Hindawi Publishing)
CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
Middle East & Africa Database
ProQuest Central
Engineering Research Database
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Publicly Available Content Database
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
Middle East & Africa Database
ProQuest Central Korea
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
DatabaseTitleList CrossRef



Civil Engineering Abstracts

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: RHX
  name: Open Access Journals (Hindawi Publishing)
  url: http://www.hindawi.com/journals/
  sourceTypes: Publisher
– sequence: 2
  dbid: DOA
  name: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 3
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1607-887X
Editor Wei, Guoliang
Editor_xml – sequence: 1
  givenname: Guoliang
  surname: Wei
  fullname: Wei, Guoliang
EndPage 542-163
ExternalDocumentID oai_doaj_org_article_0627b31cc0f24028aec7eca562ff310f
3179034661
A423816406
10_1155_2013_686845
490580
P20160913003_201312_201611030027_201611030027_536_542_163
GroupedDBID -~9
.4S
.DC
188
24P
29G
2UF
2WC
2XV
3V.
4.4
5GY
5VS
8FE
8FG
8R4
8R5
AAFWJ
AAJEY
ABDBF
ABUWG
ACGFO
ACIPV
ACIWK
ADBBV
AENEX
AFKRA
AFPKN
AIAGR
AINHJ
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ARCSS
BCNDV
BENPR
BGLVJ
BPHCQ
CCPQU
CNMHZ
CS3
CVCKV
CWDGH
DU5
EAD
EAP
EAS
EBS
EDO
EJD
EMK
ESX
GROUPED_DOAJ
H13
HCIFZ
IAO
IEP
IL9
ITC
J9A
K6V
K7-
KQ8
M~E
OK1
P2P
P62
PIMPY
PQQKQ
PROAC
Q2X
QF4
QN7
REM
RHU
RHX
RNS
TR2
TUS
UPT
UZ4
ADJCN
AHFXO
C1A
CAG
COF
IPNFZ
RIG
RHW
AAYXX
CITATION
7SC
7TB
8FD
AZQEC
DWQXO
FR3
GNUQQ
JQ2
KR7
L7M
L~C
L~D
PQEST
PQUKI
PRINS
ID FETCH-LOGICAL-a566t-7935358169a589ddd9631aa804f2a40ed251df0c5eb6ad95f0319c0a502444303
IEDL.DBID RHX
ISSN 1026-0226
IngestDate Mon Nov 04 19:56:53 EST 2024
Fri Oct 25 00:39:37 EDT 2024
Thu Oct 10 22:23:45 EDT 2024
Tue Oct 15 04:47:37 EDT 2024
Fri Aug 23 03:03:46 EDT 2024
Sun Jun 02 18:55:05 EDT 2024
Wed Nov 06 05:55:15 EST 2024
Tue Oct 01 22:51:15 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2013
Language English
License This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a566t-7935358169a589ddd9631aa804f2a40ed251df0c5eb6ad95f0319c0a502444303
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ORCID 0000-0002-5567-8025
OpenAccessLink https://dx.doi.org/10.1155/2013/686845
PQID 1476632084
PQPubID 237300
ParticipantIDs doaj_primary_oai_doaj_org_article_0627b31cc0f24028aec7eca562ff310f
proquest_miscellaneous_1520937921
proquest_journals_1476632084
gale_infotracacademiconefile_A423816406
crossref_primary_10_1155_2013_686845
hindawi_primary_10_1155_2013_686845
emarefa_primary_490580
airiti_journals_P20160913003_201312_201611030027_201611030027_536_542_163
PublicationCentury 2000
PublicationDate 2013-01-01
PublicationDateYYYYMMDD 2013-01-01
PublicationDate_xml – month: 01
  year: 2013
  text: 2013-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Cairo, Egypt
PublicationPlace_xml – name: Cairo, Egypt
– name: New York
PublicationTitle Discrete Dynamics in Nature and Society
PublicationYear 2013
Publisher Hindawi Limiteds
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Hindawi Limited
Publisher_xml – name: Hindawi Limiteds
– name: Hindawi Puplishing Corporation
– name: Hindawi Publishing Corporation
– name: John Wiley & Sons, Inc
– name: Hindawi Limited
References (5) 2010; 201
Dósa G. Sgall J. First Fit bin packing: a tight analysis Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science 2013 10.4230/LIPIcs.STACS.2013.538
(4) 2011; 38
Milenkovic V. J. Daniels K. M. Translational polygon containment and minimal enclosure using linear programming based restriction Proceedings of the 28th Annual ACM Symposium on the Theory of Computing May 1996 New York, NY, USA 109 118 2-s2.0-0029703214
(1) 2010; 158
(7) 2013; 225
(9) 1995; 84
(3) 2011; 38
Sindelar M. Sitaraman R. K. Shenoy P. Sharing-aware algorithms for virtual machine colocation Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '11) June 2011 San Jose, Calif, USA 367 377 2-s2.0-79959630327 10.1145/1989493.1989554
(6) 2011; 38
Daniels K. M. Milenkovic V. J. Multiple translational containment: approximate and exact algorithms Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms January 1995 San Francisco, Calif, USA 205 214
11
1
3
(10) 2013; 225
5
7
(6) 1995; 84
References_xml – volume: 225
  start-page: 199
  issue: 2
  year: 2013
  end-page: 210
  ident: 7
  article-title: A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints
  publication-title:
– volume: 84
  start-page: 539
  issue: 3
  year: 1995
  end-page: 561
  ident: 9
  article-title: Compaction and separation algorithms for non-convex polygons and their applications
  publication-title:
– volume: 201
  start-page: 751
  issue: 3
  year: 2010
  end-page: 759
  ident: 5
  article-title: Metaheuristics for vehicle routing problems with three-dimensional loading constraints
  publication-title:
– volume: 38
  start-page: 205
  issue: 1
  year: 2011
  end-page: 215
  ident: 6
  article-title: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
  publication-title:
– volume: 38
  start-page: 140
  issue: 1
  year: 2011
  end-page: 151
  ident: 3
  article-title: A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
  publication-title:
– volume: 38
  start-page: 617
  issue: 3
  year: 2011
  end-page: 640
  ident: 4
  article-title: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
  publication-title:
– volume: 158
  start-page: 1668
  issue: 15
  year: 2010
  end-page: 1675
  ident: 1
  article-title: Tighter bounds of the First Fit algorithm for the bin-packing problem
  publication-title:
– volume: 84
  start-page: 539
  issue: 3
  year: 1995
  ident: 6
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(95)00021-H
– ident: 11
  doi: 10.1016/j.dam.2010.05.026
– volume: 225
  start-page: 199
  issue: 2
  year: 2013
  ident: 10
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2012.09.023
– ident: 1
  doi: 10.1016/j.cor.2010.04.008
– ident: 3
  doi: 10.1016/j.cor.2010.08.017
– ident: 5
  doi: 10.1016/j.ejor.2009.03.046
– ident: 7
  doi: 10.1016/j.cor.2010.04.013
SSID ssj0020892
Score 1.9426548
Snippet The research on the triangle packing problem has important theoretic significance, which has broad application prospects in material processing, network...
SourceID doaj
proquest
gale
crossref
hindawi
emarefa
airiti
SourceType Open Website
Aggregation Database
Publisher
StartPage 536
SubjectTerms Algorithms
Approximation
Colleges & universities
Differential equations, Partial
Heuristic
Heuristic programming
Mathematical research
Networks
Optimization
Orientation
Polygons
Science
Strategy
Triangles
SummonAdditionalLinks – databaseName: Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dixMxEB_kUNAH8etw9ZSIBz4tt5tNsolvVTyqoBS8g3sL2U1yd1C3crb47zuTpPUOQV98Ktum2-18ZH6TZH4DcEj8HwEDSR18M9TEM1kTz02Noxs3aowhgZYGPn9R81Px6UyeXWv1RWfCMj1wFtwR0egOXYtfjbQRoF0Y-zA6DNsxIjSJafZtzDaZKqlWo03e5-R0xJarUpmHwROz_bY7UlppqmC67S6JO-hGUErc_alA1-G1283Vdy4oS_55-cesnULR8QO4XzAkm-Vnfwi3wvQI7l1jFnwMb2dsHjaZhZnNlucr_P2LbwwRKvu6WtIiAjtB05vOl4Et3Ejr5WyRe8s8gdPjDyfv53Vpk1CjFNS6Rg-TxGKmjJPaeO_Rp1rndCMidyhrjxDGx2aUYVDOGxmpcAk1ITE8C4EhbB_2ptUUngJzPXfK9WrQwQsfogkR9aVaL8RoBjFU8DELzBZL_2EXnDjqDO2KdZZk23J6US31L8Oc9-aF7JSVgltEgRUcbmVuv2dmDZsyEinTfWzWUQXvSB-7IUSHnd5AI7HFSOy_jKSC_aLN3X2EaaRuKnhDyrXkzesrN7pSlIDiIF4sOxMEaRSingpeF_3__WkPtrbxW0St6BHXoU2KCl7tPkY3pr0ZN4XVBsfQcaSuN7x99j_-8HO4y1PfDlorOoC99dUmvED0tB5eJkf5BdzlCiM
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3da9swED-2dIP1YeyrzGs3PFbYk6ktS7Lcl5GOlmywErYW-iZkS0oLmd2lDvv3e2cr7sqgT8GJEPF96L50vwPYJ_wPh4YkcTatEsKZTAjnJsHVqakV2hBHqYEfp3J2zr9fiIuQcLsJ1yo3Z2J_UNu2phz5QcYLNI4sVfzL9Z-EpkZRdTWM0HgMWwwjhXQCW0fHp_OfY8iVqnKodzK6astk6NBDI4pRf5YfSCUVdTI9MVeEIXTPOPUY_n2jrsFnM57ZTy8pWv579d_p3ZukkxfwPPiS8XRg_kt45JpXsP0PwuBrOJzGM7ce0Jjj6XKBb9Rd_o7RU41_tUtKJsRnKILNYuniuakpbx7Phxkzb-D85Pjs6ywJ4xISgz5Zl6CmCUIzk6URqrTWom5lxqiUe2aQ5hZdGevTWrhKGlsKTw1MyBGBZppzNGU7MGnaxr2F2BTMSFPISjnLrfOl88g3mVnO67LiVQTfBoLpIPE3es4Iq66k6liuibYZow-Z0RwzjH3vP4hcasGZRm8wgv0NzfX1gLCh-8hEiH4fPfAogiPix7iEYLH7L9rVQgct04S5XOUZypmnqpEyri5cjeRh3qMf6yPYCdwc9-FlKlQawWdiriat7lamNqE5AclB-Fh6ysm1kej9RPAp8P_hf7u3kY07Et2JcAQfx59RnalGYxrXrnENXUvKi5Jl7x7eYheesX4yB2WD9mDSrdbuPfpHXfUhKMEtHSUCqw
  priority: 102
  providerName: ProQuest
Title A Heuristic Algorithm for Solving Triangle Packing Problem
URI https://www.airitilibrary.com/Article/Detail/P20160913003-201312-201611030027-201611030027-536-542-163
https://search.emarefa.net/detail/BIM-490580
https://dx.doi.org/10.1155/2013/686845
https://www.proquest.com/docview/1476632084
https://search.proquest.com/docview/1520937921
https://doaj.org/article/0627b31cc0f24028aec7eca562ff310f
Volume 2013
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3da9swED_WjsH2MPZV6q0LGivsycyWJVnqm1uSZYWV0LWQPQnZkttC5ow2of9-72zX6weMPRk7sh3uw_e7O-kngF3i_wgYSOLgkzImnsmYeG5iHJ24SmMMCVQa-HGkpqficC7n_QTZq8ctfIx2mJ6n2VellRZyAza0Jvc7ns6HtCrRputpcppOy1W_Cu_BrRhh3AXxBN0LQC1Pf7sY1-G5G77Lz84pI76-ePSFbsPO5BW87PEiKzoFv4YnoXkDL-6wCL6FvYJNw7pjXGbF4myJ7z__zRCNsp_LBRUM2AmaWXO2CGzmKqqNs1m3j8w7OJ2MTw6mcb8lQuwQd61i9CZJjGXKOKmN9x79J3VOJ6LmDuXqEa74OqlkKJXzRta0SAmlLjEUC4Hhags2m2UTtoG5nDvlclXq4IUPtQk16kalXojKlKKM4HsnMNtb9ZWdceKjM9QByyzJNuV0UCntVYb57f0TmSkrBbeI-CLYvZW5_dOxaNg2-5CyfY7tdBTBPuljGELU1-0FNAfbe5IlXuUyS9GWauoMaReqPFQoHl7XiFXrCLZ6bQ7PESaROongCynXkueuLl3l-gUIKA7iwLKFIPiiEOFE8LnX_7__7c6tbfwVUSpyxHBokyKCT8PP6LLUh3FNWK5xDE09ynLD0_f_9aIP8Jy3m3BQ4WcHNleX6_ARodCqHKE_TL6N4GlRHI5_4XF_fDQ7HrWFhVHrJTemY_uv
link.rule.ids 315,783,787,866,867,880,881,2109,12777,21400,27936,27937,33385,33386,33756,33757,43612,43817,74369,74636
linkProvider Hindawi Publishing
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3db9MwED_BALE9IL4mwjYIYhJP0RLHdhxeUJkoHWxTJTppb5YTO92kkmxdKv597hI3Y0LaU5XWspr78H35fgewT_gfDg1J5GxcRIQzGRHOTYSrY1MqtCGOUgMnp3Jyxn-ci3OfcLvx1yrXZ2J3UNumpBz5QcIzNI4sVvzL1XVEU6OouupHaDyERzxFW02d4uPvQ8AVq7yvdjK6aMuk789DE4oxf5IeSCUV9TE9NpeEIHTHNHUI_l2brsFnM5zYTy4oVv5z-d_Z3Rmk8XN45j3JcNSz_gU8cPVL2PoHX_AVfB6FE7fqsZjD0WKO79Ne_A7RTw1_NQtKJYQzFMB6vnDh1JSUNQ-n_YSZ13A2_jY7nER-WEJk0CNrI9QzQVhmMjdC5dZa1KzEGBXzihmkuEVHxlZxKVwhjc1FRe1LyA-BRppzNGTbsFE3tXsDocmYkSaThXKWW1flrkKuycRyXuYFLwI46gmmvbzf6CkjpLqcamOpJtomjD5kQlPMMPK9-yBSqQVnGn3BAPbXNNdXPb6G7uISIbp9dM-jAL4SP4YlBIrdfdEs59rrmCbE5SJNUMoqqhkp48rMlUgeVlXoxVYBbHtuDvvwPBYqDuATMVeTTrdLUxrfmoDkIHQsPeLk2Ej0fQL46Pl__7_dXcvGLYluBTiAD8PPqMxUoTG1a1a4hi4lpVnOkrf3b_Eenk5mJ8f6-Oj05w5ssm5GB-WFdmGjXa7cHnpKbfGuU4e__Q0ENg
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3rb9MwED_BeAg-IB6bFhgQxCQ-RU0c23H4gsqjdDymSmzSvllObHeTSrN1qfj3uUvcjAlpn6q0ltXcw3e-x-8A9gn_w6EhSZxNq4RwJhPCuUlwdWpqhTbEUWjg56GcHvNvJ-Ik1D9dhrLKzZnYHdS2qSlGPsp4gcaRpYqPfCiLmH2efDi_SGiCFGVawziN23AHraIkCVeTr8PlK1Vln_lkVHTLZOjVQ3OK9_8sH0klFfU03TVnhCZ0zUx1aP5dy67BZzOc3vdO6d785-y_c7wzTpPH8Ch4lfG4F4MncMstn8LDf7AGn8H7cTx16x6XOR4v5vg-7envGH3W-FezoLBCfITCuJwvXDwzNUXQ41k_bWYbjidfjj5NkzA4ITHonbUJ6pwgXDNZGqFKay1qWWaMSrlnBqlv0amxPq2Fq6SxpfDUyoS8EWiwOUejtgNby2bpdiE2BTPSFLJSznLrfOk8clBmlvO6rHgVwUFPMB1k_1LPGKHWlZQnyzXRNmP0ITOaaIa34OsPIpdacKbRL4xgf0Nzfd5jbejujiJEt4_ueRTBR-LHsIQAsrsvmtVcB33ThL5c5RlKnKf8kTKuLlyN5GHeo0frI9gJ3Bz24WUqVBrBO2KuJv1uV6Y2oU0ByUFIWXrMycmR6AdF8Dbw_-Z_u7eRjSsSXQlzBG-Gn1GxKVtjlq5Z4xoqUMqLkmXPb97iNdxHTdA_Dg6_v4AHrBvXQSGiPdhqV2v3Ep2mtnrVacNf_ScIdA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Heuristic+Algorithm+for+Solving+Triangle+Packing+Problem&rft.jtitle=Discrete+dynamics+in+nature+and+society&rft.au=Wang%2C+Ruimin&rft.au=Luo%2C+Yuqiang&rft.au=Dong%2C+Jianqiang&rft.au=Liu%2C+Shuai&rft.date=2013-01-01&rft.pub=Hindawi+Publishing+Corporation&rft.issn=1026-0226&rft.eissn=1607-887X&rft.volume=2013&rft_id=info:doi/10.1155%2F2013%2F686845&rft.externalDocID=10_1155_2013_686845
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1026-0226&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1026-0226&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1026-0226&client=summon