This pages is an overview page, which links to various program codes (source and/or binaries), instances and results related to publications, where I have been involved.

- Steiner tree problem with revenues, budget and hop-constraints
- Facility Location Problems
- Steiner tree problem, AKA the StayNerd/Mozartballs code from the 11th DIMACS challenge
- Bilevel Integer Programming and Interdiction Problems
- Connected Facility Location Problem
- Dual Ascent-based Solution Framework for the Prize-Collecting Steiner Tree Problem and Related Problems
- Generalized Clustered Orienteering Problem
- Relax-and-Cut for Maximum Weight Connected Subgraph Problems
- Stochastic Steiner tree problem
- Minimum Cost Dominating Tree Problem
- Upgrading Spanning Tree Problem
- Tree t-spanner Problem
- S-Labeling Problem
- Time-Constrained Maximal Covering Routing Problem
- Weighted Total Domination Problem