Closure problem
In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight or minimum-weight closure in a vertex-weighted directed graph.It may be solved in polynomial time using a reduction to the maximum flow problem. It may be used to model various application problems of choosing an optimal subset of tasks to perform, with dependencies between pairs of tasks, one example being in open pit mining.
primaryTopic
Closure problem
In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight or minimum-weight closure in a vertex-weighted directed graph.It may be solved in polynomial time using a reduction to the maximum flow problem. It may be used to model various application problems of choosing an optimal subset of tasks to perform, with dependencies between pairs of tasks, one example being in open pit mining.
has abstract
In graph theory and combinator ...... mple being in open pit mining.
@en
Wikipage page ID
20,815,865
page length (characters) of wiki page
Wikipage revision ID
990,679,460
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In graph theory and combinator ...... mple being in open pit mining.
@en
label
Closure problem
@en