Monkey Algorithm for Packing Circles with Binary Variables
The problem of packing non-congruent circles within a rectangular container is considered. The objective is to place the maximum number of circles inside the container such that no circle overlaps with another one. This problem is known to be NP-Hard. Dealing with these problems efficiently is diffi...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
2019
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85054750586&doi=10.1007%2f978-3-030-00979-3_58&partnerID=40&md5=5805717f5fbfbe8e0984738416318dad http://eprints.utp.edu.my/22280/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|