Chemins extrémaux d'un graphe doublement valué

DOI10.1051/RO/1984180302211zbMATH Open0551.90096OpenAlexW2527631104MaRDI QIDQ3343804FDOQ3343804

Authors: Philippe Chrétienne 

Publication date: 1984

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

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

Recommendations

• scientific article; zbMATH DE number 3929052
• A linear time algorithm for the maximum capacity path problem
• Determination of the tree of minimax paths in a weighted digraph
• scientific article; zbMATH DE number 815069
• scientific article; zbMATH DE number 5289563

zbMATH Keywords

directed graphoptimal valuevaluationfixed height path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cited In (1)

• The basic cyclic scheduling problem with deadlines

This page was built for publication: Chemins extrémaux d'un graphe doublement valué

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