Go to the corresponding LIPIcs Volume Portal |
Moalic, Laurent ; Schmitt, Dominique ; Lepagnot, Julien ; Kritter, Julien
pdf-format: |
|
@InProceedings{moalic_et_al:LIPIcs:2020:12242, author = {Laurent Moalic and Dominique Schmitt and Julien Lepagnot and Julien Kritter}, title = {{Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {84:1--84:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Sergio Cabello and Danny Z. Chen}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12242}, URN = {urn:nbn:de:0030-drops-122423}, doi = {10.4230/LIPIcs.SoCG.2020.84}, annote = {Keywords: metaheuristics, memetic algorithms, convex partition optimization} }
Keywords: | metaheuristics, memetic algorithms, convex partition optimization | |
Collection: | 36th International Symposium on Computational Geometry (SoCG 2020) | |
Issue Date: | 2020 | |
Date of publication: | 08.06.2020 |