Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mathematics of computing ��� Network optimization"'
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem
This paper considers the Maximum Selective Tree Problem (MSelTP) as a generalization of the Maximum Induced Tree problem. Given an undirected graph with a partition of its vertex set into clusters, MSelTP aims to choose the maximum number of vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87b4571bef4f659a56b2712c4bbe99e4
LIPIcs, Volume 144, ESA'19, Complete Volume
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34a8b6b3f55835346da65632604b86fe
https://drops.dagstuhl.de/opus/volltexte/2019/11300/
https://drops.dagstuhl.de/opus/volltexte/2019/11300/