@InProceedings{onar_et_al:LIPIcs.SEA.2023.13,
author = {Onar, \"{O}mer Burak and Ekim, T{\i}naz and Ta\c{s}k{\i}n, Z. Caner},
title = {{Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem}},
booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-279-2},
ISSN = {1868-8969},
year = {2023},
volume = {265},
editor = {Georgiadis, Loukas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.13},
URN = {urn:nbn:de:0030-drops-183634},
doi = {10.4230/LIPIcs.SEA.2023.13},
annote = {Keywords: maximum induced tree, selective tree, cutting plane, separation algorithm, mixed integer programming}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode