Zobrazeno 1 - 10
of 335
pro vyhledávání: '"Gerhard J. Woeginger"'
Autor:
Dirk Briskorn, Gerhard J. Woeginger
Publikováno v:
Operations Research Letters. 51:285-288
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6930c32d325e66f66ab6810669cbad85
https://doi.org/10.1016/j.orl.2023.03.010
https://doi.org/10.1016/j.orl.2023.03.010
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef50832b14884c0e4ae0c51bd92b2368
https://doi.org/10.1007/978-3-031-32726-1_33
https://doi.org/10.1007/978-3-031-32726-1_33
Autor:
Gerhard J. Woeginger
Publikováno v:
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies 19(2), 157-181 (2021). doi:10.1007/s10288-021-00477-y
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies 19(2), 157-181 (2021). doi:10.1007/s10288-021-00477-y
Published by Springer, Berlin ; Heidelberg
Published by Springer, Berlin ; Heidelberg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01cf9ee4a6df106b8a1dd522c771e10e
https://doi.org/10.1007/s10288-021-00477-y
https://doi.org/10.1007/s10288-021-00477-y
Publikováno v:
Algorithmica : an international journal in computer science 82(5), 1081-1100 (2019). doi:10.1007/s00453-019-00639-9
Algorithmica, 82(5), 1081-1100. Springer
Algorithmica, 82(5), 1081-1100. Springer
Algorithmica : an international journal in computer science (2019). doi:10.1007/s00453-019-00639-9 special issue: "Special Issue: Computing and Combinatorics"
Published by Springer, New York, NY
Published by Springer, New York, NY
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2a03c56892ee2e0dc8a8537a42f0ff8
http://www.scopus.com/inward/record.url?scp=85074731029&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85074731029&partnerID=8YFLogxK
Publikováno v:
4OR 20(4), 713-718 (2021). doi:10.1007/s10288-021-00499-6
4OR (2021). doi:10.1007/s10288-021-00499-6
Published by Springer, Berlin ; Heidelberg
Published by Springer, Berlin ; Heidelberg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d311d8eeef3ac32c1bacbf9e5b486125
https://publications.rwth-aachen.de/record/838285
https://publications.rwth-aachen.de/record/838285
Autor:
Dennis Fischer, Gerhard J. Woeginger
Publikováno v:
Operations Research Letters. 48:784-786
We construct a fast algorithm with time complexity O ( n log n ) for a continuous bilevel knapsack problem with interdiction constraints for n items. This improves on a recent algorithm from the literature with quadratic time complexity O ( n 2 ) .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::664dd9464cba7945fb747a514c1ad878
https://doi.org/10.1016/j.orl.2020.09.007
https://doi.org/10.1016/j.orl.2020.09.007
Publikováno v:
Theoretical Computer Science, 769, 18-31. Elsevier
We study the parameterized complexity of the dominating set problem in geometric intersection graphs. • In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87b67fa5399d0a5df314afc09268ebda
https://doi.org/10.1016/j.tcs.2018.10.007
https://doi.org/10.1016/j.tcs.2018.10.007
Publikováno v:
Omega : The International Journal of Management Science, 83, 275-286. Elsevier
Scheduling theory is a well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the scheduling community. Our aim is to bring these two fields closer toge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3906cecf9edbddb2d154cdbe5cbbb3eb
https://research.tue.nl/en/publications/7f9c361d-954d-4bf6-a5a2-2326e955be25
https://research.tue.nl/en/publications/7f9c361d-954d-4bf6-a5a2-2326e955be25
Autor:
Astrid Pieterse, Gerhard J. Woeginger
Publikováno v:
Theory of computing systems 65(5), 884-900 (2021). doi:10.1007/s00224-021-10034-z
Theory of computing systems (2021). doi:10.1007/s00224-021-10034-z
Published by Springer, [Berlin ; Heidelberg]
Published by Springer, [Berlin ; Heidelberg]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51864835f5dbedbdc9a4caca711e92e6
http://edoc.hu-berlin.de/18452/27170
http://edoc.hu-berlin.de/18452/27170
Publikováno v:
Discrete applied mathematics 303, 94-107 (2021). doi:10.1016/j.dam.2020.08.012 special issue: "Combined Special Issue: 1) 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019) / Guest edited by Johann Hurink, Bodo Manthey 2) WEPA 2018 (Second Workshop on Enumeration Problems and Applications); Guest edited by Takeaki Uno, Andrea Marino"
7. Cologne–Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, Enschede, Netherlands, 2019-07-01-2019-07-032. Workshop on Enumeration Problems and Applications, WEPA 2018, Pisa, Italy, 2018-11-05-2018-11-08
7. Cologne–Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, Enschede, Netherlands, 2019-07-01-2019-07-032. Workshop on Enumeration Problems and Applications, WEPA 2018, Pisa, Italy, 2018-11-05-2018-11-08
7th Cologne–Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, Enschede, Netherlands, 1 Jul 2019 - 3 Jul 2019 2nd Workshop on Enumeration Problems and Applications, WEPA 2018, Pisa, Italy, 5 Nov 2018 - 8 Nov 2018; Discrete applied
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f5c5dff885f19b995b1aff52e7c5aa4