Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Alexander Tesch"'
Autor:
Miro Jukić, Alexander Tesch, Jakov Todorić, Tomislav Šušnjar, Klaudio-Pjer Milunović, Tomislav Barić, Zenon Pogorelić
Publikováno v:
Liječnički vjesnik, Vol 145, Iss Supp 1, Pp 158-165 (2023)
Uvod: Jednodnevna kirurgija danas je naširoko prihvaćena za brojne elektivne laparoskopske postupke u djece. Cilj ove studije jest procijeniti sigurnost i učinkovitost otpuštanja iz bolnice unutar 24 sata kod djece koja su apendektomirana laparos
Externí odkaz:
https://doaj.org/article/169c0c41e6cc45119b1c5bbf3676c1a6
Autor:
Miro Jukić, Alexander Tesch, Jakov Todorić, Tomislav Šušnjar, Klaudio Pjer Milunović, Tomislav Barić, Zenon Pogorelić
Publikováno v:
Children, Vol 9, Iss 8, p 1220 (2022)
(1) Background: One-day surgery has been widely adopted for many elective laparoscopic procedures in pediatric patients. Recently, the same protocol has been investigated for some emergency procedures, such as laparoscopic appendectomy. This study ai
Externí odkaz:
https://doaj.org/article/2109ade95462441f8e03089ac60e37ca
Autor:
Alexander Tesch
Publikováno v:
Journal of Scheduling. 23:233-251
In this paper, we study event-based mixed-integer programming (MIP) formulations for the resource-constrained project scheduling problem (RCPSP) that represent an alternative to the more common time-indexed model (DDT) (Pritsker et al. in Manag Sci 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc06d48d68e0dfaeff315a1c5e419b69
https://doi.org/10.1007/s10951-020-00647-6
https://doi.org/10.1007/s10951-020-00647-6
Autor:
Ralf Doerner, Alexander Tesch, Axel Hildebrand, Stephan Leenders, Tobias Tropper, Wilhelm Wilke, Christian Winkler, Julian Hillig, Alec Pestov, James A. Walsh, Bruce H. Thomas, Gerhard Kimenkowski, Stephen Walton, Torsten W. Kuhlen, Geert Matthys, Holger Regenbrecht, Chris Heinrich, Xiumin Shang, Marcelo Kallmann, Benjamin Lok, Francisco A. Jimenez, Cheryl Wilson, Marc Erich Latoschik, Carolin Wienrich, Silke Grafe, Mario Botsch, Jonny Collins
Publikováno v:
Virtual and Augmented Reality (VR/AR) ISBN: 9783030790615
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7c03fcab23d240ed0ab9eb2eb904afd
https://doi.org/10.1007/978-3-030-79062-2_9
https://doi.org/10.1007/978-3-030-79062-2_9
Autor:
Alexander Tesch, Ralf Dörner
Publikováno v:
ACM Multimedia
For evaluating the appearance and design language of car interiors, the surface quality and shapes are inspected by highly trained professionals. At the same time, virtual reality (VR) is making major progress, pushing the boundaries of this technolo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b44e6022f2363536b6eba99360e722c
https://doi.org/10.1145/3394171.3413980
https://doi.org/10.1145/3394171.3413980
Autor:
Thomas Schlechte, Joseph Paat, Alexander Tesch, Rosemarie Martienssen, Brady Gilg, Senan Seymen, Torsten Klug, Christof Schulz
Publikováno v:
Journal of Rail Transport Planning & Management. 8:16-28
Managing rolling stock with no passengers aboard is a critical component of railway operations. One aspect of managing rolling stock is to park the rolling stock on a given set of tracks at the end of a day or service. Depending on the parking assign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de4504bd7bc9142f0714059c614f3749
https://doi.org/10.1016/j.jrtpm.2017.12.004
https://doi.org/10.1016/j.jrtpm.2017.12.004
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030046927
WAOA
WAOA
We consider the stochastic extensible bin packing problem (SEBP) in which n items of stochastic size are packed into m bins of unit capacity. In contrast to the classical bin packing problem, the number of bins is fixed and they can be extended at ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cd60db7ce69f8f1a6acf8196a307e51
https://doi.org/10.1007/978-3-030-04693-4_20
https://doi.org/10.1007/978-3-030-04693-4_20
Autor:
Alexander Tesch
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319983332
CP
CP
We consider the Cumulative Scheduling Problem (CuSP) in which a set of n jobs must be scheduled according to release dates, due dates and cumulative resource constraints. In constraint programming, the CuSP is modeled as the cumulative constraint. Am
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61bd63171046e20e820f959442d4aa9f
https://doi.org/10.1007/978-3-319-98334-9_41
https://doi.org/10.1007/978-3-319-98334-9_41
Autor:
Alexander Tesch
Publikováno v:
Operations Research Proceedings 2016 ISBN: 9783319557014
In this article, we study compact Mixed-Integer Programming (MIP) models for the Resource-Constrained Project Scheduling Problem (RCPSP). Compared to the classical time-indexed formulation, the size of compact models is strongly polynomial in the num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::daed8de48ebabcf9a25062e5811ac329
https://doi.org/10.1007/978-3-319-55702-1_4
https://doi.org/10.1007/978-3-319-55702-1_4
Autor:
Alexander Tesch
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319449524
CP
CP
In constraint programming, energetic reasoning constitutes a powerful start time propagation rule for cumulative scheduling problems (CuSP). This article first presents an improved time interval checking algorithm that is derived from a polyhedral mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e94a8a6bdcb88e48d9f8dfda457b9265
https://doi.org/10.1007/978-3-319-44953-1_32
https://doi.org/10.1007/978-3-319-44953-1_32