An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (Q6138511): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Near-shortest and K-shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria path and tree problems: discussion on exact algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation of Yen's ranking loopless paths algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a relaxed maximally disjoint path pair problem: a bicriteria approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of solution strategies for biobjective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective and multi-constrained non-additive shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:45, 2 August 2024

scientific article; zbMATH DE number 7734447
Language Label Description Also known as
English
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
scientific article; zbMATH DE number 7734447

    Statements

    Identifiers