Implantation et complexité des techniques de programmation dynamique dans les méthodes de confection de tournées et d'horaires

DOI10.1051/RO/1991250302911zbMath0733.90035OpenAlexW2509320247MaRDI QIDQ3360654

Publication date: 1991

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105016

zbMATH Keywords

shortest path discrete dynamic programming resource constraints ``pulling algorithms``reaching algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Implantation et complexité des techniques de programmation dynamique dans les méthodes de confection de tournées et d'horaires