Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Lei Shang, Michele Garraffa, Federico Della Croce, and Vincent T'Kindt. Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 28:1-28:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{shang_et_al:LIPIcs.IPEC.2017.28, author = {Shang, Lei and Garraffa, Michele and Della Croce, Federico and T'Kindt, Vincent}, title = {{Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {28:1--28:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28}, URN = {urn:nbn:de:0030-drops-85468}, doi = {10.4230/LIPIcs.IPEC.2017.28}, annote = {Keywords: Exact exponential algorithm, Single machine total tardiness, Branch-and-merge} }
Feedback for Dagstuhl Publishing