| Publication | Date of Publication | Type |
|---|
| Fare inspection patrolling under in-station selective inspection policy | 2024-09-03 | Paper |
| Min–max optimization of node‐targeted attacks in service networks | 2024-03-15 | Paper |
| Preprocessing for segment routing optimization | 2024-01-18 | Paper |
| A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints | 2023-12-12 | Paper |
| Fill‐rate service level constrained distribution network design | 2023-11-29 | Paper |
| Loads scheduling for demand response in energy communities | 2023-11-13 | Paper |
| Strategic bidding in price coupled regions | 2022-07-15 | Paper |
| Benders decomposition for network design covering problems | 2022-03-09 | Paper |
| Benders decomposition for Network Design Covering Problems | 2020-07-13 | Paper |
| A study of general and security Stackelberg game formulations | 2019-06-27 | Paper |
| A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs | 2019-06-21 | Paper |
| A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem | 2018-06-13 | Paper |
| Models for the piecewise linear unsplittable multicommodity flow problems | 2018-05-29 | Paper |
| Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem | 2018-05-24 | Paper |
| Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol | 2017-12-20 | Paper |
| Extended formulation for hop constrained distribution network configuration problems | 2017-11-23 | Paper |
| On the hop-constrained survivable network design problem with reliable edges | 2016-11-17 | Paper |
| Distributed monitoring problem | 2016-10-18 | Paper |
| Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol | 2015-10-16 | Paper |
| Intra-domain traffic engineering with shortest path routing protocols | 2013-08-08 | Paper |
| A branch‐and‐cut algorithm for the ring spur assignment problem | 2013-08-06 | Paper |
| Stochastic binary problems with simple penalties for capacity constraints violations | 2013-05-06 | Paper |
| Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty | 2012-11-15 | Paper |
| On the hazmat transport network design problem | 2011-09-09 | Paper |
| Improved formulations for the ring spur assignment problem | 2011-09-09 | Paper |
| Applications of meta-heuristics to traffic engineering in IP networks | 2011-08-17 | Paper |
| Efficient techniques and tools for intra-domain traffic engineering | 2011-08-17 | Paper |
| Easy distributions for combinatorial optimization problems with probabilistic constraints | 2010-12-23 | Paper |
| Intra-domain traffic engineering with shortest path routing protocols | 2010-06-16 | Paper |
| Optimization of OSPF routing in IP networks | 2010-02-09 | Paper |
| An improved Benders decomposition applied to a multi-layer network design problem | 2009-11-17 | Paper |
| Polyhedral approaches to the design of survivable networks | 2007-07-23 | Paper |
| Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut | 2006-01-13 | Paper |
| Increasing internet capacity using local search | 2005-01-17 | Paper |
| Two-connected networks with rings of bounded cardinality | 2004-03-15 | Paper |
| A tabu search algorithm for self-healing ring network design. | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793422 | 2003-02-11 | Paper |
| Polyhedral results for two-connected networks with bounded rings | 2002-12-01 | Paper |
| Solving the Two-Connected Network with Bounded Meshes Problem | 2002-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515976 | 2000-11-26 | Paper |
| Operational Research: Methods and Applications | N/A | Paper |
