Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem Network_Flows — Constraint detection

A pure network flow minimum cost flow problem is defined by a given set of arcs and a given set of nodes , where each arc has a known capacity and unit cost and each node has a fixed external flow . The optimization problem is to determine the minimum cost plan for sending flow through the network to satisfy supply and demand requirements . The arc flows must be nonegative and be no greater than the arc capacities , and they must satisfy conservation of flow at the nodes .

Problem Network_Flows — Detection of the decisions and objects to be modeled

A pure network flow minimum cost flow problem is defined by a given set of arcs and a given set of nodes , where each arc has a known capacity and unit cost and each node has a fixed external flow . The optimization problem is to determine the minimum cost plan for sending flow through the network to satisfy supply and demand requirements . The arc flows must be nonegative and be no greater than the arc capacities , and they must satisfy conservation of flow at the nodes .

Back to list