Arie M. C. A. Koster

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 27

Top Topics

Robust Optimization

Knapsack Problem

Miller Tucker Zemlin

Top Venues

EURO J. Comput. Optim.

J. Comb. Optim.

Comput. Oper. Res.

Publications

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
Robust transshipment problem under consistent flow constraints. Networks 83 (1) (2024)
Arie M. C. A. Koster, Jenny Segschneider, Nicole Ventsch
-robust optimization of project scheduling problems. Comput. Oper. Res. 161 (2024)
Jenny Segschneider, Arie M. C. A. Koster
Robust two-dose vaccination schemes and the directed b-matching problem. Discret. Appl. Math. 356 (2024)
Christina Büsing, Timo Gersing, Arie M. C. A. Koster
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. IPCO (2023)
Christina Büsing, Timo Gersing, Arie M. C. A. Koster
A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. 15 (2) (2023)
Jenny Segschneider, Arie M. C. A. Koster
Optimal Vaccination Strategies for Multiple Dose Vaccinations. ISCO (2022)
Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
Robust minimum cost flow problem under consistent flow constraints. Ann. Oper. Res. 312 (2) (2022)
Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. 22 (1) (2022)
Christina Büsing, Arie M. C. A. Koster
Foreword. INOC (2022)
Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. SEA (2022)
Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints. CoRR (2020)
Arie M. C. A. Koster, Clemens Thielen
Special issue on: Computational discrete optimization. EURO J. Comput. Optim. 8 (3) (2020)
Grit Ecker, Di Yuan, Arie M. C. A. Koster, Anke Schmeink
Accurate optimization models for interference constrained bandwidth allocation in cellular networks. Comput. Oper. Res. 101 (2019)
Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves
A flow based pruning scheme for enumerative equitable coloring algorithms. Ann. Oper. Res. 272 (1-2) (2019)
Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster
On the Burning Number of p-Caterpillars. CoRR (2019)
Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka
Formulations and algorithms for the recoverable Γ-robust knapsack problem. EURO J. Comput. Optim. 7 (1) (2019)
Jan Hackfeld, Arie M. C. A. Koster
The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35 (3) (2018)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust flows over time: models and complexity results. Math. Program. 171 (1-2) (2018)
Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann
Lot sizing with storage losses under demand uncertainty. J. Comb. Optim. 36 (3) (2018)
Arie M. C. A. Koster, Michael Poss
Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. 6 (3) (2018)
Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy
Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis. GLOBECOM (2017)
Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves
Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. Networks 70 (4) (2017)
Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners
Improved handling of uncertainty and robustness in set covering problems. Eur. J. Oper. Res. 263 (1) (2017)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust Flows over Time: Models and Complexity Results. CoRR (2016)
Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves
On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. 52 (2016)
Christina Büsing, Arie M. C. A. Koster, Martin Tieves
Robust plans for spectrum allocation in elastic flexgrid optical networks. RNDM (2016)
Sebastian Goderbauer, Björn Bahl, Philip Voll, Marco E. Lübbecke, André Bardow, Arie M. C. A. Koster
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Comput. Chem. Eng. 95 (2016)
Jacek Rak, Mario Pickavet, Kishor S. Trivedi, Javier Alonso Lopez, Arie M. C. A. Koster, James P. G. Sterbenz, Egemen K. Çetinkaya, Teresa Gomes, Matthias Gunkel, Krzysztof Walkowiak, Dimitri Staessens
Future research directions in design of reliable communication systems. Telecommun. Syst. 60 (4) (2015)
Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
The multi-band robust knapsack problem - A dynamic programming approach. Discret. Optim. 18 (2015)
Grit Claßen, Arie M. C. A. Koster, Manuel Kutschka, Issam Tahiri
Robust Metric Inequalities for Network Loading Under Demand Uncertainty. Asia Pac. J. Oper. Res. 32 (5) (2015)
Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves
Virtual network embedding under uncertainty: Exact and heuristic approaches. DRCN (2015)
Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner
Optimal offline virtual network embedding with rent-at-bulk aspects. CoRR (2015)
Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich
Network planning under demand uncertainty with robust optimization. IEEE Commun. Mag. 52 (2) (2014)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553 (2014)
Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno
Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS J. Comput. 26 (4) (2014)
Svetoslav Duhovnikov, Arie M. C. A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke
Γ-robust network design for Mixed-Line-Rate-Planning of Optical Networks. OFC/NFOEC (2013)
Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
Pre-processing for Triangulation of Probabilistic Networks CoRR (2013)
Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Comput. Oper. Res. 40 (1) (2013)
Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
Robust network design: Formulations, valid inequalities, and computations. Networks 61 (2) (2013)
David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves
Robust Redundancy Elimination for Energy-Aware Routing. GreenCom/iThings/CPScom (2013)
Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
Speeding up column generation for robust wireless network planning. EURO J. Comput. Optim. 1 (3-4) (2013)
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
On exact algorithms for treewidth. ACM Trans. Algorithms 9 (1) (2012)
Nayyar Almas Kazmi, Arie M. C. A. Koster, Jürgen Branke
Formulations and algorithms for the multi-path selection problem in network routing. ICUMT (2012)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS (2012)
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50 (3) (2012)
Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC (2011)
Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
Cutset Inequalities for Robust Network Design. INOC (2011)
Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly
On cut-based inequalities for capacitated network design polyhedra. Networks 57 (2) (2011)
Arie M. C. A. Koster, Manuel Kutschka
An integrated model for survivable network design under demand uncertainty. DRCN (2011)
Arie M. C. A. Koster, Stephan Lemkens
Designing AC Power Grids Using Integer Linear Programming. INOC (2011)
Hans L. Bodlaender, Arie M. C. A. Koster
Treewidth computations II. Lower bounds. Inf. Comput. 209 (7) (2011)
Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka
Recoverable Robust Knapsacks: Γ-Scenarios. INOC (2011)
Alexander Hein, Arie M. C. A. Koster
An Experimental Evaluation of Treewidth at Most Four Reductions. SEA (2011)
Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
On the Robustness of Optimal Network Designs. ICC (2011)
Grit Classen, Arie M. C. A. Koster, Anke Schmeink
Robust planning of green wireless networks. NetGCoop (2011)
Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka
Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5 (3) (2011)
Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
Bandwidth assignment for reliable fixed broadband wireless networks. WOWMOM (2011)
Nayyar Almas Kazmi, Arie M. C. A. Koster
An integer linear programming model for optimal self protection multi-path selection. ICUMT (2011)
Hans L. Bodlaender, Arie M. C. A. Koster
Treewidth computations I. Upper bounds. Inf. Comput. 208 (3) (2010)
Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
Towards robust network design using integer linear programming techniques. NGI (2010)
Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. Algorithmica 55 (2) (2009)
Arie M. C. A. Koster, Vadim V. Lozin
DIMAP Workshop on Algorithmic Graph Theory. Electron. Notes Discret. Math. 32 (2009)
Arie M. C. A. Koster, Annegret Katrin Wagler
Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO Oper. Res. 42 (4) (2008)
Hans L. Bodlaender, Arie M. C. A. Koster
Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51 (3) (2008)
Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
Treewidth Lower Bounds with Brambles. Algorithmica 51 (1) (2008)
Hans L. Bodlaender, Arie M. C. A. Koster
On the maximum cardinality search lower bound for treewidth. Discret. Appl. Math. 155 (11) (2007)
Michael Menth, Rüdiger Martin, Arie M. C. A. Koster, Sebastian Orlowski
Overview of resilience mechanisms based on multipath structures. DRCN (2007)
Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. ESA (2007)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153 (1) (2007)
Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster
Safe Reduction Rules for Weighted Treewidth. Algorithmica 47 (2) (2007)
Arie M. C. A. Koster, Annegret Wagler
On determining the imperfection ratio. Electron. Notes Discret. Math. 25 (2006)
Hans L. Bodlaender, Arie M. C. A. Koster
Safe separators for treewidth. Discret. Math. 306 (3) (2006)
Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster
Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10 (1) (2006)
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
On Exact Algorithms for Treewidth. ESA (2006)
Arie M. C. A. Koster, Adrian Zymolka
On cycles and the stable multi-set polytope. Discret. Optim. 2 (3) (2005)
Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof
Preprocessing Rules for Triangulation of Probabilistic Networks. Comput. Intell. 21 (3) (2005)
Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
Degree-Based Treewidth Lower Bounds. WEA (2005)
Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
Treewidth Lower Bounds with Brambles. ESA (2005)
Arie M. C. A. Koster, Adrian Zymolka, Monika Jäger, Ralf Huelsermann
Demand-wise Shared Protection for Meshed Optical Networks. J. Netw. Syst. Manag. 13 (1) (2005)
Claus G. Gruber, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly, Adrian Zymolka
A computational study for demand-wise shared protection. DRCN (2005)
Hans L. Bodlaender, Arie M. C. A. Koster
On the Maximum Cardinality Search Lower Bound for Treewidth. WG (2004)
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
Contraction and Treewidth Lower Bounds. ESA (2004)
Hans L. Bodlaender, Arie M. C. A. Koster
Safe Seperators for Treewidth. ALENEX/ANALC (2004)
Arie M. C. A. Koster
Demand-wise shared protection for meshed optical networks. DRCN (2003)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. 4OR 1 (4) (2003)
Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133 (1-3) (2003)
Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster
Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22 (1) (2002)
Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
Polyhedral results for the edge capacity polytope. Math. Program. 92 (2) (2002)
Arie M. C. A. Koster, Adrian Zymolka
Stable multi-sets. Math. Methods Oper. Res. 56 (1) (2002)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
Solving partial constraint satisfaction problems with tree decomposition. Networks 40 (3) (2002)
Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8 (2001)
Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
Pre-processing for Triangulation of Probabilistic Networks. UAI (2001)
Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel
A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur. J. Oper. Res. 127 (1) (2000)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
. Electron. Notes Discret. Math. 3 (1999)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG (1999)
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23 (3-5) (1998)