Continuous-time shortest path problems with stopping and starting costs (Q1195684): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q1123803 / rank
Normal rank
 
Property / author
 
Property / author: Alistair I. Mees / rank
Normal rank
 
Property / author
 
Property / author: Andy B. Philpott / rank
 
Normal rank
Property / author
 
Property / author: Alistair I. Mees / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Railway scheduling by network optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight paths in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest route with time dependent length of edges and limited delay possibilities in nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-objective approximation of feasible but unsolvable linear complementarity problems / rank
 
Normal rank

Latest revision as of 13:54, 16 May 2024

scientific article
Language Label Description Also known as
English
Continuous-time shortest path problems with stopping and starting costs
scientific article

    Statements

    Identifiers