Two almost easy problems

zbMATH Open1136.90489MaRDI QIDQ3428830FDOQ3428830

Authors: György Dósa 

Publication date: 29 March 2007

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

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)

Cited In (3)

• Two dimensions are easier
• Two measures of difficulty
• Two Problems for Sophistication

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)