Network flow problem
id:
network-flow-problem-258-6948949
title:
Network flow problem
text:
In combinatorial optimization, network flow problems are a class of computational problems in which the input is a flow network, and the goal is to construct a flow, numerical values on each edge that respect the capacity constraints and that have incoming flow equal to outgoing flow at all vertices except for certain designated terminals. Specific types of network flow problems include: The maximum flow problem, in which the goal is to maximize the total amount of flow out of the source termina
brand slug:
wiki
category slug:
encyclopedia
description:
Class of computational problems
original url:
https://en.wikipedia.org/wiki/Network_flow_problem
date created:
date modified:
2021-02-15T08:19:36Z
main entity:
{"identifier":"Q55644260","url":"https://www.wikidata.org/entity/Q55644260"}
image:
fields total:
13
integrity:
14