Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
Friedhelm Stappert, Andreas Ermedahl, Jakob Engblo...
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...