Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Sebastian Stiller"'
Publikováno v:
Algorithms, Vol 14, Iss 1, p 21 (2021)
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with
Externí odkaz:
https://doaj.org/article/ffe16d0859164ea2ba908c295d055d27
Wind turbines organized in wind farms will be one of the main electric power sources of the future. Each wind turbine causes a wake with a reduced wind speed. This wake influences the power of downstream turbines. Therefore, there is a strong interac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d204cae78af691714481dd544239e4e
https://doi.org/10.5194/wes-2023-2
https://doi.org/10.5194/wes-2023-2
Publikováno v:
Mathematical Programming, 149 (1-2)
We commence an algorithmic study of Bulk-Robustness, a new model of robustness in combinatorial optimization. Unlike most existing models, Bulk-Robust combinatorial optimization features a highly nonuniform failure model. Instead of an interdiction b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c4c36477887aa332d768f6e88ba6b74
http://doc.rero.ch/record/332688/files/10107_2014_Article_760.pdf
http://doc.rero.ch/record/332688/files/10107_2014_Article_760.pdf
Autor:
Sebastian Stiller
Publikováno v:
Mitteilungen der Deutschen Mathematiker-Vereinigung. 27:49-52
Publikováno v:
Transportation Science. 52:38-58
Logistics is a cost sensitive industry with large and fast growing routing networks. In this paper we devise a computational, robust optimization method for the strategic routing decisions of a logistics’ customer, i.e., a company that uses the ser
Publikováno v:
European Journal of Operational Research. 260:829-840
Mathematical research on multicriteria optimization problems predominantly revolves around the set of Pareto optimal solutions. In practice, on the other hand, methods that output a single solution are more widespread. Reference point methods are a s
Autor:
Sebastian Stiller
Publikováno v:
Mitteilungen der Deutschen Mathematiker-Vereinigung. 28:185-186
Publikováno v:
Algorithms
Volume 14
Issue 1
Algorithms, 2021, 14(1), 21; https://doi.org/10.3390/a14010021--http://www.mdpi.com/journal/algorithms--http://www.bibliothek.uni-regensburg.de/ezeit/?2455149--1999-4893
Algorithms, Vol 14, Iss 21, p 21 (2021)
Volume 14
Issue 1
Algorithms, 2021, 14(1), 21; https://doi.org/10.3390/a14010021--http://www.mdpi.com/journal/algorithms--http://www.bibliothek.uni-regensburg.de/ezeit/?2455149--1999-4893
Algorithms, Vol 14, Iss 21, p 21 (2021)
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with
Autor:
Sebastian Stiller
Publikováno v:
Mitteilungen der Deutschen Mathematiker-Vereinigung. 28:181-181
Autor:
Gabrio Caimi, Giorgio Medeossi, Anita Schöbel, Valentina Cacchiani, Dario Pacciarelli, Erwin Abbink, Armin Fügenschuh, Stefano de Fabris, Johanna Törnquist Krasemann, Laura Galli, Nikola Bešinović, Dennis Huisman, Frank Fischer, Ronny S. Hansmann, Leo Kroon, Henning Homfeld, Uwe Zimmermann, Torsten Klug, Carlo Mannino, Rob M.P. Goverde, Andreas Bärmann, Leonardo Lamorgese, Marc Johann, Sebastian Stiller, Frauke Liers, Anke Stieber, Thomas Schlechte, Paolo Toth, Markus Reuther, Marie Schmidt, Markus Bohlin, Hanno Schülldorf, Twan Dollevoet
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783319721521
This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dc33822610b9f7341406ac19b218dca
https://doi.org/10.1007/978-3-319-72153-8
https://doi.org/10.1007/978-3-319-72153-8