Two almost easy problems

MaRDI QIDQ3428830zbMATH OpenFDO

Authors György Dósa

Publication date 29 March 2007

zbMATH Keywords

time-dependent networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Optimal flows in dynamic networks and algorithms for their finding
• Shortest paths in a network with time-dependent flow speeds
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Shortest paths in piecewise continuous time-dependent networks
• Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées

Cited in

(4)

• Two Problems for Sophistication
• Two dimensions are easier
• Two measures of difficulty
• NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times

This page was built for publication: Two almost easy problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428830)