A Packing Problem, Solved by Genetic Algorithms
| dc.creator | Franck-Oberaspach,Georg | |
| dc.creator | Schweiger,Dietmar | |
| dc.creator | Svozil,Karl | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:50:10Z | |
| dc.date.available | 2024-02-06T12:50:10Z | |
| dc.description | An arbitrary number of points are arranged in a given twodimensional simply connected region such that their mutual distances and the distance from the region boundary becomes a maximum. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-08-0464 | |
| dc.identifier | https://lib.jucs.org/article/27573/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7595 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(8): 464-470 | |
| dc.title | A Packing Problem, Solved by Genetic Algorithms | |
| dc.type | Research Article |