%0 Conference Paper %1 conf/bioma/ZhengH24 %A Zheng, He %A Hao, Jin-Kao %B MIC (1) %D 2024 %E Sevaux, Marc %E Olteanu, Alexandru-Liviu %E Pardo, Eduardo G. %E Sifaleras, Angelo %E Makboul, Salma %I Springer %K dblp %P 3-8 %T Breakout Local Search for Heaviest Subgraph Problem. %U http://dblp.uni-trier.de/db/conf/metaheuristics/mic2024-1.html#ZhengH24 %V 14753 %@ 978-3-031-62912-9

@inproceedings{conf/bioma/ZhengH24, added-at = {2024-06-27T00:00:00.000+0200}, author = {Zheng, He and Hao, Jin-Kao}, biburl = {https://www.bibsonomy.org/bibtex/2ef951c7ba9345678df404ce97fcc8076/dblp}, booktitle = {MIC (1)}, crossref = {conf/metaheuristics/2024-1}, editor = {Sevaux, Marc and Olteanu, Alexandru-Liviu and Pardo, Eduardo G. and Sifaleras, Angelo and Makboul, Salma}, ee = {https://doi.org/10.1007/978-3-031-62912-9_1}, interhash = {0390a06377bbeb8a2c4e13ef2266da83}, intrahash = {ef951c7ba9345678df404ce97fcc8076}, isbn = {978-3-031-62912-9}, keywords = {dblp}, pages = {3-8}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-07-01T07:08:17.000+0200}, title = {Breakout Local Search for Heaviest Subgraph Problem.}, url = {http://dblp.uni-trier.de/db/conf/metaheuristics/mic2024-1.html#ZhengH24}, volume = 14753, year = 2024 }