Lehr- und Forschungsgebiet Diskrete Optimierung

Discrete Optimization 18 (2015), 123--149.

Virtual network embedding under uncertainty: Exact and heuristic approaches

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

11th International Conference on the Design of Reliable Communication Networks (DRCN 2015), IEEE (2015), 1--8.

Network Design with Compression: Complexity and Algorithms

Arie M.C.A. Koster, Martin Tieves

Operations Research and Computing: Algorithms and Software for Analytics - Proceedings of the 14th INFORMS Computing Society Conference (ICS2015), INFORMS (2015), 74--87.

Future research directions in design of reliable communication systems

J. Raczek, Mario Pickavet, Kishor Trivedi, Javier Alonso Lopez, Arie M.C.A. Koster, James P.G. Sterbenz, Egemen K. Çetinkaya, Teresa Gomes, Matthias Gunkel, Krzysztof Walkowiak, Dimitri Staessens

Telecommunication Systems 60 (2015), no. 4, 423--450.

Network planning under demand uncertainty with robust optimization

T. Bauschert, Christina Büsing, Fabio Dandreagiovanni, Arie M.C.A. Koster, Manuel Kutschka, Uwe Steglich

IEEE Communications Magazine 52 (2014), no. 2, 178--185.

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

L. Belke, T. Kesselheim, Arie M.C.A. Koster, B. Vöcking

Theoretical Computer Science 553 (2014), 64--73.

Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks

Grit Claßen, D. Coudert, Arie M.C.A. Koster, N. Nepomuceno

INFORMS Journal on Computing 26 (2014), no. 4, 893--909.

Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control

L. Belke, T. Kesselheim, Arie M.C.A. Koster, B. Vöcking

Proceedings of 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Springer (2013), 30--41.

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

Computers & Operations Research 40 (2013), no. 1, 80--90.

Speeding Up Column Generation for Robust Wireless Network Planning

EURO Journal on Computational Optimization 1 (2013), no. 3, 253-281.

Robust Redundancy Elimination for Energy-Aware Routing

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

IEEE GreenCom 2013, IEEE (2013), 179-186.

Γ-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 National Fiber Optic Engineers Conference (OFC 2013), Optical Society of America (2013), JTh2A.02.

Robust Network Design: Formulations, Valid Inequalities, and Computations

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

Networks 61 (2013), no. 2, 128–-149.

Extended Cutset Inequalities for the Network Power Consumption Problem

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

Electronic Notes in Discrete Mathematics 41 (2013), 69-76.

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos

Theory of Computing Systems 50 (2012), no. 3, 420--432.

On exact algorithms for treewidth

Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos

ACM Transactions on Algorithms 9 (2012), no. 1, Art 12.

Formulations and algorithms for multipath selection problem for network routing

N.A. Kazmi, Arie M.C.A. Koster, J. Branke

Proceedings of RNDM 2012, IEEE (2012), 738 -744.

BMBF Project ROBUKOM: Robust Communication Networks

Arie M.C.A. Koster, C. Helmberg, A. Bley, M. Grötschel, T. Bauschert

Proceedings of the 12th Würzburg Workshop on IP: ITG Workshop "Visions of Future Generation Networks" (EuroView2012) (2012).

Column Generation for Frequency Assignment in Slow Frequency Hopping Networks

Arie M.C.A. Koster, Martin Tieves

EURASIP Journal on Wireless Communications and Networking (2012), no. 253, 1-14.

Treewidth Computations II. Lower Bounds

Information and Computation 209 (2011), no. 7, 1103--1119.

Recoverable Robust Knapsacks: Gamma-Scenarios

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

Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 583--588.

Recoverable Robust Knapsacks: the Discrete Scenario Case

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

Optimization Letters 5 (2011), no. 3, 379--392.

Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés

C. Caillouet, Arie M.C.A. Koster

13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel11) (2011), 119-122.

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

Grit Claßen, D. Coudert, Arie M.C.A. Koster, N. Nepomuceno

Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany, June 2011, Proceedings, Springer (2011), 37--42.

Bandwidth assignment for reliable fixed broadband wireless networks

Grit Claßen, D. Coudert, Arie M.C.A. Koster, N. Nepomuceno

12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM) (2011).

Robust Planning of Green Wireless Networks

NetGCooP 2011 International Conference on NETwork Games, COntrol and OPtimization (2011).

An Experimental Evaluation of Treewidth at most Four Reductions

A. Hein, Arie M.C.A. Koster

Proceedings of International Symposium on Experimental Algorithms (SEA 2011) (2011), 218--229.

An Integer Linear Programming Model for Optimal Self Protection Multi-Path Selection

N.A. Kazmi, Arie M.C.A. Koster

Proceedings of RNDM 2011, Reliable Network Design and Modelling (2011).

Wiley Encyclopedia of Operations Research and Management Science Treewidth, Tree Decompositions, and Brambles

In Wiley Encyclopedia of Operations Research and Management Science, Wiley (2011), .

An integrated model for survivable network design under demand uncertainty

Arie M.C.A. Koster, Manuel Kutschka

Design of Reliable Communication Networks (DRCN), 2011 8th International Workshop on the , IEEE Xplore (2011), 54--61 .

Network Design Under Demand Uncertainties: A Case Study on the Abilene and GEANT network data

Arie M.C.A. Koster, Manuel Kutschka

Tagungsband der 12. ITG-Fachtagung Photonische Netze, VDE Verlag GmbH (2011), 154--161.

Cutset Inequalities for Robust Network Design

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

Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 118--123.

On the robustness of optimal network designs

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

Proceedings IEEE International Conference on Communications, ICC 2011, IEEE Xplore (2011), 1--5.

Robust Network Design: Formulations, Valid Inequalities, and Computations

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

Technical Report 11-34, Zuse Institute Berlin (2011).

Designing AC Power Grids using Integer Linear Programming

Arie M.C.A. Koster, Stephan Lemkens

Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany, Springer (2011), 478--483.

On cut-based inequalities for capacitated network design polyhedra

Christian Raack, Arie M.C.A. Koster, S. Orlowski, R. Wessälly

Networks 57 (2011), 141--156.

Treewidth Computations I: Upper Bounds

Information and Computation 208 (2010), 259-275.

Treewidth Computations II: Lower Bounds

Technical Report UU-CS-2010, Utrecht University (2010).

Recoverable Robust Knapsacks: the Discrete Scenario Case

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

Technical Report 018-2010, Technische Universität Berlin (2010).

Towards Robust Network Design using Integer Linear Programming Techniques

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

Proceedings Next Generation Internet, NGI 2010, IEEE Xplore (2010).

Graphs and Algorithms in Communication Networks on Seven League Boots

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

In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 1--59.

Branch-and-cut techniques for solving realistic two-layer network designproblems

Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel, P. Belotti

In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 95--118.

Multi-commodity Single Path Routing with submodular bandwidth consumption

Arie M.C.A. Koster, Manuel Kutschka

Proceedings of INOC 2009 (2009).

Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts

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

Algorithmica 55 (2009), 375--391.

An integer set-packing problem arising in two-layer network design

Christian Raack, Arie M.C.A. Koster

Proceedings of INOC 2009 (2009).

Prioritizing connection requests in GMPLS-controlled optical networks

S. Ruepp, Arie M.C.A. Koster, N. Andriolli, A. V. Manolova

International Conference on Photonics in Switching, PS'09 (2009), 1-2.

Treewidth Lower Bounds with Brambles

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

Algorithmica 51 (2008), 81--98.

Combinatorial Optimisation on Graphs of bounded Treewidth

The Computer Journal 51 (2008), no. 3, 255--269.

Treewidth Computations I: Upper Bounds

Technical Report UU-CS-2008, Utrecht University (2008).

Single-Layer Cuts for Multi-Layer Network Design Problems

Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel

In Telecommunications Modeling, Policy, and Technology, Springer (S. Raghavan, Bruce Golden, Edward Wasil, eds.) (2008), 1--23.

Benchmarking RWA Strategies for Dynamically Controlled Optical Networks

Arie M.C.A. Koster, S. Ruepp

Proceedings of the 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2008) (2008).

Comparing Imperfection Ratio and Imperfection Index for Graph Classes

Arie M.C.A. Koster, A.K. Wagler

RAIRO -- Operations Research 42 (2008), 485--500.

Models and Solution Techniques for the Frequency Assignment Problem

K.I. Aardal, C.P.M. van Hoesel, Arie M.C.A. Koster, C. Mannino, A. Sassano

Annals of Operations Research 153 (2007), 79--129.

On the Maximum Cardinality Search Lower Bound for Treewidth

Discrete Applied Mathematics 155 (2007), 1348--1372.

Safe reduction rules for weighted treewidth

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

Algorithmica 47 (2007), no. 2, 139--158.

Algorithms to separate ${0,frac{1}{2}}$ Chvátal-Gomory cuts

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

Technical Report 07--10, Zuse Institute Berlin (2007).

Single-layer Cuts for Multi-layer Network Design Problems

Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel

Technical Report 07--21, ZIB (2007).

A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks

Arie M.C.A. Koster, M. Scheffel

Proceedings of INOC 2007, International Network Optimization Conference (2007).

Demand-wise Shared Protection and Multiple Failures

Arie M.C.A. Koster, A. Zymolka

Proceedings of INOC 2007, International Network Optimization Conference (2007).

Tight LP-based Lower Bounds for Wavelength Conversion in Optical Networks

Arie M.C.A. Koster, A. Zymolka

Statistica Neerlandica 61 (2007), no. 1, 115--136.

Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts

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

Proceedings 15th Annual European Symposium on Algorithms, ESA2007, Springer, Lecture Notes in Computer Science (2007), 693--704.

Overview of resilience mechanisms based on multipath structures

M. Menth, R. Martin, Arie M.C.A. Koster, S. Orlowski

Proceedings of DRCN 2007, Design of Reliable Communication Networks (2007).

Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics

S. Orlowski, Arie M.C.A. Koster, Christian Raack, R. Wessälly

Proceedings of INOC 2007, International Network Optimization Conference (2007).

Capacitated network design using general flow-cutset inequalities

Christian Raack, Arie M.C.A. Koster, S. Orlowski, R. Wessälly

Proceedings of INOC 2007, International Network Optimization Conference (2007).

On the strength of cut-based inequalities for capacitated network design polyhedra

Christian Raack, Arie M.C.A. Koster, R. Wessälly

Technical Report 07--08, ZIB (2007).

On exact algorithms for treewidth

Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos

Proceedings 14th Annual European Symposium on Algorithms, ESA 2006, Springer (2006), 672--683.

Safe Separators for Treewidth

Discrete Mathematics 306 (2006), no. 3, 337--350.

Contraction and Treewidth Lower Bounds

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

Journal of Graph Algorithms and Applications 10 (2006), no. 1, 5--49.

Availability and Cost Based Evaluation of Demand-wise Shared Protection

R. Hülsermann, M. Jäger, Arie M.C.A. Koster, S. Orlowski, R. Wessälly, A. Zymolka

Proceedings 7th ITG-Workshop on Photonic Networks, VDE Verlag GmbH (2006), 161--168.

Cost-efficient transparent optical networks with high connection availabilities

Proceedings 8th International Conference on Transparent Optical Networks, ICTON 2006 (2006), 101-104.

On determining the imperfection ratio

Arie M.C.A. Koster, A.K. Wagler

Electronic Notes in Discrete Mathematics 25 (2006), 177--181.

The extreme points of $QSTAB(G)$ and its implications

Arie M.C.A. Koster, A.K. Wagler

Technical Report 06--30, ZIB (2006).

Treewidth Lower Bounds with Brambles

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

Technical Report 05--54, ZIB (2005).

Treewidth Lower Bounds with Brambles

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

Proceedings 13th Annual European Symposium on Algorithms, ESA 2005, Springer (2005), 391--402.

Pre-processing rules for triangulation of probabilistic networks

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

Computational Intelligence 21 (2005), no. 3, 286--305.

A Computational Study for Demand-wise Shared Protection

C.G. Gruber, Arie M.C.A. Koster, S. Orlowski, R. Wessälly, A. Zymolka

Proceedings of DRCN 2005, Design of Reliable Communication Networks (2005), 421--428.

A new model and a computational study for Demand-wise Shared Protection

C.G. Gruber, Arie M.C.A. Koster, S. Orlowski, R. Wessälly, A. Zymolka

Technical Report 05--55, ZIB (2005).

Branch and Tree Decomposition Techniques for Discrete Optimization

I.V. Hicks, Arie M.C.A. Koster, E. Kolotouglu

In TutORials 2005, INFORMS Annual Meeting (J. Cole Smith, eds.) (2005), 1--29.

Wavelength Assignment in Multifiber WDM Networks

Proceedings of INOC 2005, International Network Optimization Conference (2005), 60--66.

Wavelength Assignment in Multifiber WDM Networks by Generalized Edge Coloring

Linear Programming Lower Bounds for Minimum Converter Wavelength Assignment in Optical Networks

Technical Report 05--13, ZIB (2005).

Comparing Imperfection Ratio and Imperfection Index for Graph Classes

Arie M.C.A. Koster, A.K. Wagler

Technical Report 05--50, ZIB (2005).

Degree-Based Treewidth Lower Bounds

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

Proceedings of 4th International Workshop on Efficient and Experimental Algorithms, WEA 2005 (2005), 101--112.

Arie M.C.A. Koster, A. Zymolka

Proceedings of INOC 2005, International Network Optimization Conference (2005), 44--51.

On cycles and the stable multi-set polytope

Arie M.C.A. Koster, A. Zymolka

Discrete Optimization 2 (2005), no. 3, 241--255.

Provably Good Solutions for Wavelength Assignment in Optical Networks

Arie M.C.A. Koster, A. Zymolka

Proceedings of ONDM 2005, The 9th IFIP Working Conference on Optical Network Design & Modelling (2005), 335--345.

Demand-wise Shared Protection for Meshed Optical Networks

Arie M.C.A. Koster, A. Zymolka, M. Jäger, R. Hülsermann

Journal of Network and Systems Management 13 (2005), no. 1, 35--55.

Demand-wise Shared Protection revisited: A new model for survivable network design

R. Wessälly, S. Orlowski, A. Zymolka, Arie M.C.A. Koster, C.G. Gruber

Proceedings of INOC 2005, International Network Optimization Conference (2005), 100--105.

Kostenoptimierung mit Garantie: Konfiguration und Design von Kommunikationsnetzen

A. Bley, Arie M.C.A. Koster, R. Wessälly, A. Zymolka

Tagungsband der 5. ITG-Fachtagung Photonische Netze, VDE Verlag GmbH (2004), 121--128.

On the Maximum Cardinality Search Lower Bound for Treewidth

Technical Report 04--45, ZIB (2004).

On the Maximum Cardinality Search Lower Bound for Treewidth

Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 (2004), 81--92.

Safe Separators for Treewidth

Joint Proceedings of the workshop on Algorithm Engineering and Experiments (ALENEX'04) and the workshop on Analytic Algorithmics and Combinatorics (ANALCO'04) (2004), 70--78.

Contraction and Treewidth Lower Bounds

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

Technical Report 04--29, ZIB (2004).

Contraction and Treewidth Lower Bounds

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

Proceedings of 12th Annual European Symposium on Algorithms, ESA 2004 (2004), 628--639.

Degree-Based Treewidth Lower Bounds

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

Technical Report 04--44, ZIB (2004).

Linear Programming Lower Bounds for Minimum Converter Wavelength Assignment in Optical Networks

Arie M.C.A. Koster, A. Zymolka

Technical Report 04--41, ZIB (2004).

Minimum Converter Wavelength Assignment in All-Optical Networks

Arie M.C.A. Koster, A. Zymolka

Proceedings of ONDM 2004, The 8th IFIP Working Conference on Optical Network Design & Modelling (2004), 517--535.

Provably Good Solutions for Wavelength Assignment in Optical Networks

Arie M.C.A. Koster, A. Zymolka

Technical Report 04--40, ZIB (2004).

A note on Contraction Degeneracy

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

Technical Report 04--43, ZIB (2004).

Models and Solution Techniques for the Frequency Assignment Problem

K.I. Aardal, C.P.M. van Hoesel, Arie M.C.A. Koster, C. Mannino, A. Sassano

4OR 1 (2003), no. 4, 261--317.

Kosten- und Qualitätsoptimierung in Kommunikationsnetzen

A. Bley, Arie M.C.A. Koster, A. Kröller, R. Wessälly, A. Zymolka

Technical Report 03--31, ZIB (2003).

Kosten- und Qualitätsoptimierung in Kommunikationsnetzen

A. Bley, Arie M.C.A. Koster, A. Kröller, R. Wessälly, A. Zymolka

TeleKommunikation Aktuell 57 (2003), no. 07+08, 1--62.

Safe Separators for Treewidth

Technical Report 03--32, ZIB (2003).

Pre-processing rules for triangulation of probabilistic networks

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

Technical Report UU--2003--, UU (2003).

Bidirected/unidirected capacity installation in telecommunication networks

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

Discrete Applied Mathematics 133 (2003), 103--121.

Minimum Converter Wavelength Assignment in All-Optical Networks

Arie M.C.A. Koster, A. Zymolka

Technical Report 03--45, ZIB (2003).

Polyhedral Investigations on Stable Multi-Sets

Arie M.C.A. Koster, A. Zymolka

Technical Report 03--10, ZIB (2003).

Demand-wise Shared Protection for Meshed Optical Networks

Arie M.C.A. Koster, A. Zymolka, M. Jäger, R. Hülsermann, C. Gerlach

Technical Report 03--24, ZIB (2003).

Demand-wise Shared Protection for Meshed Optical Networks

Arie M.C.A. Koster, A. Zymolka, M. Jäger, R. Hülsermann, C. Gerlach

Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003), IEEE (2003), 85--92.

Transparent optical network design with sparse wavelength conversion

A. Zymolka, Arie M.C.A. Koster, R. Wessälly

Proceedings of ONDM 2003, The 7th IFIP Working Conference on Optical Network Design & Modelling (2003), 61--80.

Safe reduction rules for weighted treewidth

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

Technical Report 02--49, ZIB (2002).

Modelling Feasible Network Configurations for UMTS

A. Eisenblätter, A. Fügenschuh, T. Koch, Arie M.C.A. Koster, A. Martin, T. Pfender, O. Wegel, R. Wessälly

Technical Report 02--16, ZIB (2002).

Frequency Planning and Ramifications of Coloring

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

Discussiones Mathematicae Graph Theory 22 (2002), no. 1, 51--88.

Frequenzplanung im Mobilfunk

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

Technical Report 02--09, ZIB (2002).

Frequenzplanung im Mobilfunk

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

DMV-Mitteilungen (2002), no. 1, 18--25.

Modelling Feasible Network Configurations for UMTS

A. Eisenblätter, T. Koch, A. Martin, T. Achterberg, A. Fügenschuh, Arie M.C.A. Koster, O. Wegel, R. Wessälly

Telecommunications Network Design and Management, Kluwer Academic Publishers (2002), 1--24.

Load Balancing in Signaling Transfer Points

A. Eisenblätter, Arie M.C.A. Koster, R. Wallbaum, R. Wessälly

Technical Report 02--50, ZIB (2002).

Polyhedral Results for the Edge Capacity Polytope

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

Mathematical Programming, series A 92 (2002), no. 2, 335--358.

Solving partial constraint satisfaction problems with tree decomposition

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

Networks 40 (2002), no. 3, 170--180.

Stable Multi-Sets

Arie M.C.A. Koster, A. Zymolka

Mathematical Methods of Operations Research 56 (2002), no. 1, 45--65.

Transparent optical network design with sparse wavelength conversion

A. Zymolka, Arie M.C.A. Koster, R. Wessälly

Technical Report 02--34, ZIB (2002).

Models and Solution Techniques for the Frequency Assignment Problem

K.I. Aardal, C.P.M. van Hoesel, Arie M.C.A. Koster, C. Mannino, A. Sassano

Technical Report 01--40, ZIB (2001).

Pre-processing for Triangulation of Probabilistic Networks

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

Technical Report 01--39, ZIB (2001).

Pre-processing for Triangulation of Probabilistic Networks

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

Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers (2001), 32--39.

Treewidth: Computational Experiments

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

Technical Report 01--38, ZIB (2001).

Treewidth: Computational Experiments

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

Electronic Notes in Discrete Mathematics 8 (2001), 54--57.

Frequency Planning and Ramifications of Coloring

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

Technical Report 00--47, ZIB (2000).

A Dynamic Programming Algorithm for the Local Access Telecommunication Network Expansion Problem

O.E. Flippo, A.W.J. Kolen, Arie M.C.A. Koster, R.L.M.J. van de Leensel

European Journal of Operational Research 127 (2000), 189--202.

Polyhedral Results for the Edge Capacity Polytope

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

Technical Report 00--22, ZIB (2000).

Re-Optimization of Signaling Transfer Points

Technical Report 00--18, ZIB (2000).

Lower Bounds for Minimum Interference Frequency Assignment Problems

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

Ricerca Operativa 30 (2000), no. 94--95, 101--116.

Stable Multi-Sets

Arie M.C.A. Koster, A. Zymolka

Technical Report 00--36, ZIB (2000).

Frequency Assignment---Models and Algorithms

PhD thesis from UM (1999).

Lower Bounds for Minimum Interference Frequency Assignment Problems

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

Technical Report 99/026, UM (1999).

Optimal Solutions for a Frequency Assignment Problem Via Tree-Decomposition

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

Graph-Theoretic Concepts in Computer Science (WG '99), Springer-Verlag (1999), 338--349.

Solving Frequency Assignment Problems Via Tree-Decomposition

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

Technical Report 99/011, UM (1999).

Solving Frequency Assignment Problems Via Tree-Decomposition

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

Electronic Notes in Discrete Mathematics 3 (1999), 102--105.

The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems

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

Operations Research Letters 23 (1998), no. 3--5, 89--97.

A Dynamic Programming Algorithm for the ATM Network Installation Problem on a Tree

R.L.M.J. van de Leensel, O.E. Flippo, Arie M.C.A. Koster

Technical Report 98/009, UM (1998).

The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems

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

Technical Report 97/005, UM (1997).

A Dynamic Programming Algorithm for the Local Access Network Expansion Problem

O.E. Flippo, A.W.J. Kolen, Arie M.C.A. Koster, R.L.M.J. van de Leensel

Technical Report 96/027, Universiteit Maastricht (1996).

DualNet: een grafische interface voor het oplossen van netwerk problemen