Etude Et Extension D’Un Algorithme De Murghland
From MaRDI portal
Publication:4165179
DOI10.1080/03155986.1978.11731696zbMath0384.90106OpenAlexW2402297148MaRDI QIDQ4165179
Publication date: 1978
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1978.11731696
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05)
Related Items (4)
On the computational complexity of dynamic graph problems ⋮ A reoptimization algorithm for the shortest path problem with time windows ⋮ A new algorithm for reoptimizing shortest paths when the arc costs change ⋮ Shortest paths on dynamic graphs
This page was built for publication: Etude Et Extension D’Un Algorithme De Murghland
