Minimum cost path problems with relays (Q709122): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Theory of Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of some bicriterion shortest path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network design problem with relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wide area telecommunication network design: application to the Alberta SuperNet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Black and White Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label correcting methods to solve multicriteria shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label correcting approach for solving bicriterion shortest-path problems / rank
 
Normal rank

Latest revision as of 08:56, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimum cost path problems with relays
scientific article

    Statements