Finding the first \(K\) shortest paths in a time-window network. (Q1427091): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yen-Liang Chen / rank
Normal rank
 
Property / author
 
Property / author: Yen-Liang Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures and Computer Science Techniques in Operations Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(02)00230-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023766747 / rank
 
Normal rank

Latest revision as of 09:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Finding the first \(K\) shortest paths in a time-window network.
scientific article

    Statements

    Identifiers