A Network-Flow Algorithm for Project Selection

DOI10.2307/2582634MaRDI QIDQ3337915zbMATH OpenOpenAlexFDO

Authors Barrie Baker

Publication date 1984

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582634

zbMATH Keywords

activity-on-node diagramnetwork-flow algorithmproject selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 4070603
• A network flow algorithm for just-in-time project scheduling
• scientific article; zbMATH DE number 482901
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 858902

Cited in

(4)

• Separable convex programs with ratio constraints over a directed tree
• Using analytic network process and goal programming for interdependent information system project selection
• A Variant Selection Problem For A Generalized Decision Network
• Project evaluation and selection in a network of collaboration: A consensual disaggregation multi-criterion approach

This page was built for publication: A Network-Flow Algorithm for Project Selection

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