×

Plus court chemin avec contraintes d’horaires. (French) Zbl 0528.90082


MSC:

90C35 Programming involving graphs or networks
90C39 Dynamic programming
90B35 Deterministic scheduling theory in operations research
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: DOI EuDML