An Exact Lexicographic Approach for the Maximally Risk-Disjoint/Minimal Cost Path Pair Problem in Telecommunication Networks

AuthID
 P-00V-D77
3
Author(s)
Document Type
Article in Press
Year published
2021
Published
in TOP, ISSN: 1134-5764
Indexing
Wos®
Scopus®
Google Scholar®
Publication Identifiers
Scopus: 2-s2.0-85114900534
Wos: WOS:000695772600001
Source Identifiers
ISSN: 1134-5764
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service