Hilfe beim Zugang

Haben Sie den VPN-Client gestartet bzw. sind Sie via Shibboleth angemeldet (weitere Informationen)?

An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks

Abstract The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that aims at finding a pair of paths between two given nodes, which is the shortest (in terms of cost) among those that have the fewest risks in common. This problem is of particular importance in...
Ausführliche Beschreibung