Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Guntram Scheithauer"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 9, Iss , Pp 100003- (2021)
An important aspect in railway maintenance management is the scheduling of tamping actions in which two aspects need to be considered: first, the reduction of travel costs for crews and machinery; and second, the reduction of time-dependent costs cau
Externí odkaz:
https://doaj.org/article/c4622a117bc14cb18a19fe8fd28828ab
Publikováno v:
TOP. 30:296-331
The energy consumption of large-scale data centers or server clusters is expected to grow significantly in the next couple of years contributing to up to 13% of the worldwide energy demand in 2030. As the involved processing units require a dispropor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4881a6c5f556a158101ccb70541c2202
https://doi.org/10.1007/s11750-021-00613-1
https://doi.org/10.1007/s11750-021-00613-1
Publikováno v:
Operations Research Proceedings ISBN: 9783030484385
OR
OR
The energy consumption of large-scale data centers or server clusters is expected to grow significantly in the next couple of years contributing to up to 13% of the worldwide energy demand in 2030. As the involved processing units require a dispropor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f23ad3c85109d8924aa51b8ea1b2f406
https://doi.org/10.1007/978-3-030-48439-2_19
https://doi.org/10.1007/978-3-030-48439-2_19
Autor:
John Martinovic, Guntram Scheithauer
Publikováno v:
Discrete Optimization. 29:77-102
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of products with minimum length L that can be constructed by connecting a given supply of m ∈ N smaller item le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5abf049162e706789b01ccec072d593
https://doi.org/10.1016/j.disopt.2018.03.001
https://doi.org/10.1016/j.disopt.2018.03.001
Publikováno v:
4OR. 17:173-200
Based on an application in the field of server consolidation, we consider the one-dimensional cutting stock problem with nondeterministic item lengths. After a short introduction to the general topic we investigate the case of normally distributed it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94c1aac6eb59a15df57179bc869c2ff2
https://doi.org/10.1007/s10288-018-0384-4
https://doi.org/10.1007/s10288-018-0384-4
Autor:
John Martinovic, Guntram Scheithauer
Publikováno v:
Optimization. 67:1797-1817
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: given a supply of (small) items, the aim is to construct as many large items...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d865cf8a838caa5b7c10a1459fe87d22
https://doi.org/10.1080/02331934.2018.1494171
https://doi.org/10.1080/02331934.2018.1494171
Publikováno v:
Optimization. 68:1963-1983
The Minimum Connectivity Inference (MCI) problem represents an NP -hard generalization of the well-known minimum spanning tree problem and has been studied in different fields of research i...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::554a18f138a3333fe3db50f54ea5e772
https://doi.org/10.1080/02331934.2018.1465944
https://doi.org/10.1080/02331934.2018.1465944
Autor:
John Martinovic, Guntram Scheithauer
Publikováno v:
Annals of Operations Research. 271:811-829
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of objects, each having a length of at least L, that can be constructed by connecting a given supply of $$ m \in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef242f0dccbd9dd094e3213329c4ce7c
https://doi.org/10.1007/s10479-018-2762-x
https://doi.org/10.1007/s10479-018-2762-x
Autor:
Guntram Scheithauer, John Martinovic
Publikováno v:
Discrete Applied Mathematics. 229:161-167
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of products with minimum length L that can be constructed by connecting a given supply of m ∈ N smaller item le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa85c167ecf3fa6db4c282a8e4120b77
https://doi.org/10.1016/j.dam.2017.05.015
https://doi.org/10.1016/j.dam.2017.05.015
Publikováno v:
IEEE Wireless Communications Letters. 6:494-497
Due to the significantly increased demand for wireless connectivity in recent years, the natural radio spectrum has become a very important and scarce resource. Since the utilization of the licensed spectrum may be very low, a major challenge in wire
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28166e41805a695a660feae03e6f4ecd
https://doi.org/10.1109/lwc.2017.2708105
https://doi.org/10.1109/lwc.2017.2708105