Arie M. C. A. Koster

According to our database, Arie M. C. A. Koster authored at least 94 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Robust transshipment problem under consistent flow constraints.

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

Networks, January, 2024

<i>Γ</i>-robust optimization of project scheduling problems.

Arie M. C. A. Koster, Jenny Segschneider, Nicole Ventsch

Comput. Oper. Res., January, 2024

2023

A branch and bound algorithm for robust binary optimization with budget uncertainty.

Christina Büsing, Timo Gersing, Arie M. C. A. Koster

Math. Program. Comput., June, 2023

Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty.

Christina Büsing, Timo Gersing, Arie M. C. A. Koster

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

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 S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede

BMC Medical Informatics Decis. Mak., 2022

Robust minimum cost flow problem under consistent flow constraints.

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

Ann. Oper. Res., 2022

An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP.

Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Optimal Vaccination Strategies for Multiple Dose Vaccinations.

Jenny Segschneider, Arie M. C. A. Koster

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

On the complexity of robust transshipment under consistent flow constraints.

Christina Büsing, Arie Koster, Sabrina Schmitz

Proceedings of the 10th International Network Optimization Conference, 2022

Foreword.

Christina Büsing, Arie M. C. A. Koster

Proceedings of the 10th International Network Optimization Conference, 2022

2020

Special issue on: Computational discrete optimization.

Arie M. C. A. Koster, Clemens Thielen

EURO J. Comput. Optim., 2020

2019

Formulations and algorithms for the recoverable Γ-robust knapsack problem.

Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka

EURO J. Comput. Optim., 2019

On the Burning Number of p-Caterpillars.

Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster

CoRR, 2019

Accurate optimization models for interference constrained bandwidth allocation in cellular networks.

Grit Ecker, Di Yuan, Arie M. C. A. Koster, Anke Schmeink

Comput. Oper. Res., 2019

A flow based pruning scheme for enumerative equitable coloring algorithms.

Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves

Ann. Oper. Res., 2019

2018

Robust flows over time: models and complexity results.

Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz

Math. Program., 2018

The matching extension problem in general graphs is co-NP-complete.

Jan Hackfeld, Arie M. C. A. Koster

J. Comb. Optim., 2018

Lot sizing with storage losses under demand uncertainty.

Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann

J. Comb. Optim., 2018

Special issue on: robust combinatorial optimization.

Arie M. C. A. Koster, Michael Poss

EURO J. Comput. Optim., 2018

2017

The budgeted minimum cost flow problem with unit upgrading cost.

Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome

Networks, 2017

Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations.

Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves

Networks, 2017

Improved handling of uncertainty and robustness in set covering problems.

Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners

Eur. J. Oper. Res., 2017

Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis.

Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels.

Stefano Coniglio, Arie Koster, Martin Tieves

J. Netw. Syst. Manag., 2016

On the computational complexity of the virtual network embedding problem.

Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves

Electron. Notes Discret. Math., 2016

An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems.

Sebastian Goderbauer, Björn Bahl, Philip Voll, Marco E. Lübbecke, André Bardow, Arie M. C. A. Koster

Comput. Chem. Eng., 2016

Robust plans for spectrum allocation in elastic flexgrid optical networks.

Christina Büsing, Arie M. C. A. Koster, Martin Tieves

Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration.

Stefano Coniglio, Arie Koster, Nils Spiekermann

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Future research directions in design of reliable communication systems.

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

Telecommun. Syst., 2015

The multi-band robust knapsack problem - A dynamic programming approach.

Grit Claßen, Arie M. C. A. Koster, Anke Schmeink

Discret. Optim., 2015

Optimal offline virtual network embedding with rent-at-bulk aspects.

Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner

CoRR, 2015

Robust Metric Inequalities for Network Loading Under Demand Uncertainty.

Grit Claßen, Arie M. C. A. Koster, Manuel Kutschka, Issam Tahiri

Asia Pac. J. Oper. Res., 2015

Virtual network embedding under uncertainty: Exact and heuristic approaches.

Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves

Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

2014

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control.

Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking

Theor. Comput. Sci., 2014

Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks.

Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno

INFORMS J. Comput., 2014

Network planning under demand uncertainty with robust optimization.

Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich

IEEE Commun. Mag., 2014

2013

Robust network design: Formulations, valid inequalities, and computations.

Arie M. C. A. Koster, Manuel Kutschka, Christian Raack

Networks, 2013

Extended Cutset Inequalities for the Network Power Consumption Problem.

Arie Koster, Truong Khoa Phan, Martin Tieves

Electron. Notes Discret. Math., 2013

Speeding up column generation for robust wireless network planning.

Grit Claßen, Arie M. C. A. Koster, Anke Schmeink

EURO J. Comput. Optim., 2013

A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks.

Grit Claßen, Arie M. C. A. Koster, Anke Schmeink

Comput. Oper. Res., 2013

Γ-robust network design for Mixed-Line-Rate-Planning of Optical Networks.

Svetoslav Duhovnikov, Arie M. C. A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke

Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

Robust Redundancy Elimination for Energy-Aware Routing.

David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves

Proceedings of the 2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things (iThings) and IEEE Cyber, 2013

2012

On exact algorithms for treewidth.

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos

ACM Trans. Algorithms, 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos

Theory Comput. Syst., 2012

Column Generation for Frequency Assignment in Slow Frequency Hopping Networks.

Arie Koster, Martin Tieves

EURASIP J. Wirel. Commun. Netw., 2012

Formulations and algorithms for the multi-path selection problem in network routing.

Nayyar Almas Kazmi, Arie M. C. A. Koster, Jürgen Branke

Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

2011

Recoverable robust knapsacks: the discrete scenario case.

Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka

Optim. Lett., 2011

On cut-based inequalities for capacitated network design polyhedra.

Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly

Networks, 2011

Treewidth computations II. Lower bounds.

Hans L. Bodlaender, Arie M. C. A. Koster

Inf. Comput., 2011

Bandwidth assignment for reliable fixed broadband wireless networks.

Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno

Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

An Experimental Evaluation of Treewidth at Most Four Reductions.

Alexander Hein, Arie M. C. A. Koster

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Robust planning of green wireless networks.

Grit Classen, Arie M. C. A. Koster, Anke Schmeink

Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Designing AC Power Grids Using Integer Linear Programming.

Arie M. C. A. Koster, Stephan Lemkens

Proceedings of the Network Optimization - 5th International Conference, 2011

Cutset Inequalities for Robust Network Design.

Arie M. C. A. Koster, Manuel Kutschka, Christian Raack

Proceedings of the Network Optimization - 5th International Conference, 2011

A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.

Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno

Proceedings of the Network Optimization - 5th International Conference, 2011

Recoverable Robust Knapsacks: Γ-Scenarios.

Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka

Proceedings of the Network Optimization - 5th International Conference, 2011

An integer linear programming model for optimal self protection multi-path selection.

Nayyar Almas Kazmi, Arie M. C. A. Koster

Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

On the Robustness of Optimal Network Designs.

Arie M. C. A. Koster, Manuel Kutschka, Christian Raack

Proceedings of IEEE International Conference on Communications, 2011

An integrated model for survivable network design under demand uncertainty.

Arie M. C. A. Koster, Manuel Kutschka

Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011

2010

Treewidth computations I. Upper bounds.

Hans L. Bodlaender, Arie M. C. A. Koster

Inf. Comput., 2010

Towards robust network design using integer linear programming techniques.

Arie M. C. A. Koster, Manuel Kutschka, Christian Raack

Proceedings of the Next Generation Internet (NGI), 2010

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.

Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Graphs and Algorithms in Communication Networks on Seven League Boots.

Arie M. C. A. Koster, Xavier Muñoz

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

DIMAP Workshop on Algorithmic Graph Theory.

Arie M. C. A. Koster, Vadim V. Lozin

Electron. Notes Discret. Math., 2009

Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.

Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka

Algorithmica, 2009

2008

Comparing Imperfection Ratio and Imperfection Index for Graph Classes.

Arie M. C. A. Koster, Annegret Katrin Wagler

RAIRO Oper. Res., 2008

Combinatorial Optimization on Graphs of Bounded Treewidth.

Hans L. Bodlaender, Arie M. C. A. Koster

Comput. J., 2008

Treewidth Lower Bounds with Brambles.

Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster

Algorithmica, 2008

2007

On the maximum cardinality search lower bound for treewidth.

Hans L. Bodlaender, Arie M. C. A. Koster

Discret. Appl. Math., 2007

Models and solution techniques for frequency assignment problems.

Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano

Ann. Oper. Res., 2007

Safe Reduction Rules for Weighted Treewidth.

Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster

Algorithmica, 2007

Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.

Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka

Proceedings of the Algorithms, 2007

Overview of resilience mechanisms based on multipath structures.

Michael Menth, Rüdiger Martin, Arie M. C. A. Koster, Sebastian Orlowski

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Contraction and Treewidth Lower Bounds.

Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster

J. Graph Algorithms Appl., 2006

On determining the imperfection ratio.

Arie M. C. A. Koster, Annegret Wagler

Electron. Notes Discret. Math., 2006

Safe separators for treewidth.

Hans L. Bodlaender, Arie M. C. A. Koster

Discret. Math., 2006

2005

Demand-wise Shared Protection for Meshed Optical Networks.

Arie M. C. A. Koster, Adrian Zymolka, Monika Jäger, Ralf Huelsermann

J. Netw. Syst. Manag., 2005

On cycles and the stable multi-set polytope.

Arie M. C. A. Koster, Adrian Zymolka

Discret. Optim., 2005

Preprocessing Rules for Triangulation of Probabilistic Networks.

Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof

Comput. Intell., 2005

Degree-Based Treewidth Lower Bounds.

Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

A computational study for demand-wise shared protection.

Claus G. Gruber, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly, Adrian Zymolka

Proceedings of the 5th International Workshop on Design of Reliable Communication Networks, 2005

2004

Safe Seperators for Treewidth.

Hans L. Bodlaender, Arie M. C. A. Koster

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Bidirected and unidirected capacity installation in telecommunication networks.

Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh

Discret. Appl. Math., 2003

Demand-wise shared protection for meshed optical networks.

Arie M. C. A. Koster

Proceedings of the Fourth International Workshop on Design of Reliable Communication Networks, 2003

2002

Solving partial constraint satisfaction problems with tree decomposition.

Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen

Networks, 2002

Polyhedral results for the edge capacity polytope.

Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh

Math. Program., 2002

Stable multi-sets.

Arie M. C. A. Koster, Adrian Zymolka

Math. Methods Oper. Res., 2002

Frequency planning and ramifications of coloring.

Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster

Discuss. Math. Graph Theory, 2002

2001

Treewidth: Computational Experiments.

Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel

Electron. Notes Discret. Math., 2001

Pre-processing for Triangulation of Probabilistic Networks.

Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag

Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

2000

A dynamic programming algorithm for the local access telecommunication network expansion problem.

Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel

Eur. J. Oper. Res., 2000

1999

Solving Frequency Assignment Problems via Tree-Decomposition¹.

Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen

Electron. Notes Discret. Math., 1999

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.

Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

The partial constraint satisfaction problem: Facets and lifting theorems.

Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen

Oper. Res. Lett., 1998