Arie M. C. A. Koster

According to our database1, Arie M. C. A. Koster authored at least 81 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Special issue on: Computational discrete optimization.
EURO J. Comput. Optim., 2020

Robust Minimum Cost Flow Problem Under Consistent Flow Constraints.
CoRR, 2020

Formulations and algorithms for the recoverable Γ-robust knapsack problem.
EURO J. Comput. Optim., 2019

On the Burning Number of p-Caterpillars.
CoRR, 2019

Accurate optimization models for interference constrained bandwidth allocation in cellular networks.
Comput. Oper. Res., 2019

A flow based pruning scheme for enumerative equitable coloring algorithms.
Ann. Oper. Res., 2019

Robust flows over time: models and complexity results.
Math. Program., 2018

The matching extension problem in general graphs is co-NP-complete.
J. Comb. Optim., 2018

Lot sizing with storage losses under demand uncertainty.
J. Comb. Optim., 2018

Special issue on: robust combinatorial optimization.
EURO J. Comput. Optim., 2018

The budgeted minimum cost flow problem with unit upgrading cost.
Networks, 2017

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

Improved handling of uncertainty and robustness in set covering problems.
Eur. J. Oper. Res., 2017

Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels.
J. Netw. Syst. Manag., 2016

On the computational complexity of the virtual network embedding problem.
Electron. Notes Discret. Math., 2016

An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems.
Comput. Chem. Eng., 2016

Robust plans for spectrum allocation in elastic flexgrid optical networks.
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.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Future research directions in design of reliable communication systems.
Telecommun. Syst., 2015

The multi-band robust knapsack problem - A dynamic programming approach.
Discret. Optim., 2015

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

Robust Metric Inequalities for Network Loading Under Demand Uncertainty.
Asia Pac. J. Oper. Res., 2015

Virtual network embedding under uncertainty: Exact and heuristic approaches.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control.
Theor. Comput. Sci., 2014

Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks.
INFORMS J. Comput., 2014

Network planning under demand uncertainty with robust optimization.
IEEE Commun. Mag., 2014

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

Extended Cutset Inequalities for the Network Power Consumption Problem.
Electron. Notes Discret. Math., 2013

Speeding up column generation for robust wireless network planning.
EURO J. Comput. Optim., 2013

A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks.
Comput. Oper. Res., 2013

Robust Redundancy Elimination for Energy-Aware Routing.
Proceedings of the 2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things (iThings) and IEEE Cyber, 2013

On exact algorithms for treewidth.
ACM Trans. Algorithms, 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.
Theory Comput. Syst., 2012

Column Generation for Frequency Assignment in Slow Frequency Hopping Networks.
EURASIP J. Wirel. Commun. Netw., 2012

Formulations and algorithms for the multi-path selection problem in network routing.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Recoverable robust knapsacks: the discrete scenario case.
Optim. Lett., 2011

On cut-based inequalities for capacitated network design polyhedra.
Networks, 2011

Treewidth computations II. Lower bounds.
Inf. Comput., 2011

Bandwidth assignment for reliable fixed broadband wireless networks.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

An Experimental Evaluation of Treewidth at Most Four Reductions.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Robust planning of green wireless networks.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Designing AC Power Grids Using Integer Linear Programming.
Proceedings of the Network Optimization - 5th International Conference, 2011

Cutset Inequalities for Robust Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

Recoverable Robust Knapsacks: Γ-Scenarios.
Proceedings of the Network Optimization - 5th International Conference, 2011

An integer linear programming model for optimal self protection multi-path selection.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

On the Robustness of Optimal Network Designs.
Proceedings of IEEE International Conference on Communications, 2011

An integrated model for survivable network design under demand uncertainty.
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011

Treewidth computations I. Upper bounds.
Inf. Comput., 2010

Towards robust network design using integer linear programming techniques.
Proceedings of the Next Generation Internet (NGI), 2010

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Graphs and Algorithms in Communication Networks on Seven League Boots.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

DIMAP Workshop on Algorithmic Graph Theory.
Electron. Notes Discret. Math., 2009

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

Comparing Imperfection Ratio and Imperfection Index for Graph Classes.
RAIRO Oper. Res., 2008

Combinatorial Optimization on Graphs of Bounded Treewidth.
Comput. J., 2008

Treewidth Lower Bounds with Brambles.
Algorithmica, 2008

On the maximum cardinality search lower bound for treewidth.
Discret. Appl. Math., 2007

Models and solution techniques for frequency assignment problems.
Ann. Oper. Res., 2007

Safe Reduction Rules for Weighted Treewidth.
Algorithmica, 2007

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

Contraction and Treewidth Lower Bounds.
J. Graph Algorithms Appl., 2006

On determining the imperfection ratio.
Electron. Notes Discret. Math., 2006

Safe separators for treewidth.
Discret. Math., 2006

Demand-wise Shared Protection for Meshed Optical Networks.
J. Netw. Syst. Manag., 2005

On cycles and the stable multi-set polytope.
Discret. Optim., 2005

Preprocessing Rules for Triangulation of Probabilistic Networks.
Comput. Intell., 2005

Degree-Based Treewidth Lower Bounds.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Safe Seperators for Treewidth.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

Bidirected and unidirected capacity installation in telecommunication networks.
Discret. Appl. Math., 2003

Solving partial constraint satisfaction problems with tree decomposition.
Networks, 2002

Polyhedral results for the edge capacity polytope.
Math. Program., 2002

Stable multi-sets.
Math. Methods Oper. Res., 2002

Frequency planning and ramifications of coloring.
Discuss. Math. Graph Theory, 2002

Treewidth: Computational Experiments.
Electron. Notes Discret. Math., 2001

Pre-processing for Triangulation of Probabilistic Networks.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

A dynamic programming algorithm for the local access telecommunication network expansion problem.
Eur. J. Oper. Res., 2000

Solving Frequency Assignment Problems via Tree-Decomposition<sup>1</sup>.
Electron. Notes Discret. Math., 1999

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

The partial constraint satisfaction problem: Facets and lifting theorems.
Oper. Res. Lett., 1998