Optimal Subtrees and Extensions
From MaRDI portal
Publication:3951898
DOI10.1016/S0304-0208(08)72447-2zbMath0489.90055OpenAlexW1536103070MaRDI QIDQ3951898
Alain Prodon, Thomas M. Liebling, Heinz Groeflin
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)72447-2
combinatorial optimizationsequencingacyclic graphlinear algorithmoptimal family of nested rooted subtrees of a treeoptimal lower closed set of nodespolyhedral and polarity characterizations
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Optimizing constrained subtrees of trees ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ On project scheduling with irregular starting time costs ⋮ Logic cuts for processing networks with fixed charges
This page was built for publication: Optimal Subtrees and Extensions
