Publikationen von Koster

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (78 Publikationen)
1   2   3   4     »
 
Publications 2024
Robust transshipment problem under consistent flow constraints  
Christina Büsing, Arie M.C.A. Koster, Sabrina Schmitz
Networks 83 (2024), no. 1, 53--82.
k-slow Burning: Complexity and Upper Bounds  
Michaela Hiller, Arie M.C.A. Koster, Philipp Pabst
In 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Springer (2024), .
Γ-robust optimization of project scheduling problems  
Arie M.C.A. Koster, Jenny Segschneider, Nicole Ventsch
Computers & Operations Research 161 (2024), no. 106453
 
Publications 2023
A Branch & Bound Algorithm for Robust Binary Optimization with Budget Uncertainty  
Christina Büsing, Timo Gersing, Arie M.C.A. Koster
Mathematical Programming Computation 15 (2023), 269--326.
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty  
Christina Büsing, Timo Gersing, Arie M.C.A. Koster
In Integer Programming and Combinatorial Optimization. IPCO 2023, Springer (Del Pia, A. and Kaibel, V. , eds.) (2023), 58--71.
 
Publications 2022
Robust minimum cost flow problem under consistent flow constraints  
Christina Büsing, Arie M.C.A. Koster, Sabrina Schmitz
Annals of Operations Research 312 (2022), 691--722.
Γ-robust Optimization of Project Scheduling Problems  
Arie M.C.A. Koster, Jenny Segschneider, Nicole Ventsch
Optimization Online (2022)
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions  
Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian Johann, Arie M.C.A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede
BMC Medical Informatics and Decision Making (2022)
 
Publications 2021
On the Burning Number of p-Caterpillars  
Michaela Hiller, Arie M.C.A. Koster, Eberhard Triesch
In Graphs and Combinatorial Optimization: from Theory to Applications, Springer (2021), 145--156.
Robust Network Design  
Arie M.C.A. Koster, Daniel R. Schmidt
In Network Design with Applications to Transportation and Logistics, Springer (T. G. Crainic and M. Gendreau and B. Gendron, eds.) (2021), 317--343.
 
Publications 2020
Planning out-of-hours services for pharmacies  
Christina Büsing, Timo Gersing, Arie M.C.A. Koster
Operations Research for Health Care 27 (2020)
Robust optimal aiming strategies in central receiver systems  
Sascha Kuhnke, Pascal Richter, Fynn Kepp, Jeff Cumpston, Arie M.C.A. Koster, Christina Büsing
Renewable Energy 152 (2020), 198--207.
 
Publications 2019
Formulations and algorithms for the recoverable Γ-robust knapsack problem  
Christina Büsing, Sebastian Goderbauer, Arie M.C.A. Koster, Manuel Kutschka
EURO Journal on Computational Optimization 7 (2019), no. 1, 15--45.
Accurate optimization models for interference constrained bandwidth allocation in cellular networks  
Grit Ecker, Di Yuan, Arie M.C.A. Koster, Anke Schmeink
Computers & Operations Research 101 (2019), 1--12.
On the Burning Number of p-Caterpillars  
Michaela Hiller, Eberhard Triesch, Arie M.C.A. Koster
arXiv.org (2019), no. 1912.10897, 1--10.
An adaptive discretization algorithm for the design of water usage and treatment networks  
Arie M.C.A. Koster, Sascha Kuhnke
Optimization and Engineering 20 (2019), no. 2, 497--542.
A flow based pruning scheme for enumerative equitable coloring algorithms  
Arie M.C.A. Koster, Robert Scheidweiler, Martin Tieves
Annals of Operations Research 272 (2019), no. 1--2, 3--28.
 
Publications 2018
Lot sizing with storage losses under demand uncertainty  
Stefano Coniglio, Arie M.C.A. Koster, Nils Spiekermann
Journal of Combinatorial Optimization 36 (2018), no. 3, 763--788.
Robust flows over time: models and complexity results  
Corinna Gottschalk, Arie M.C.A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Mathematical Programming, series A 171 (2018), no. 1--2, 55--85.
The matching extension problem in general graphs is co-NP-complete  
Jan Hackfeld, Arie M.C.A. Koster
Journal of Combinatorial Optimization 35 (2018), no. 3, 853--859.

Gesamte Liste anzeigen (78 Publikationen)
1   2   3   4     »