Finding the first \(K\) shortest paths in a time-window network.
type: Item
instance of: scholarly article
title: Finding the first \(K\) shortest paths in a time-window network.
zbMATH Open document ID: 1036.90025
DOI: 10.1016/S0305-0548(02)00230-7
author: Hsu-Hao Yang
author: Yen-Liang Chen
published in: Computers \& Operations Research
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2055439
zbMATH Keywords: Network
zbMATH Keywords: Time-window constraint
zbMATH Keywords: Shortest path
zbMATH Keywords: Simple path
MaRDI profile type: Publication
cites work: The quickest path problem
cites work: Q3056948
cites work: Q4796165
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
cites work: Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
cites work: Vehicle Routing with Time Windows
cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
cites work: Finding the K Shortest Loopless Paths in a Network
cites work: An efficient algorithm for K shortest simple paths
cites work: Data Structures and Computer Science Techniques in Operations Research
cites work: Finding the k Shortest Paths
cites work: A note on two problems in connexion with graphs
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
full work available at URL: s0305-0548(02)00230-7
OpenAlex ID: W2023766747
description: scientific article; zbMATH DE number 2055439