Minimum-cost flow problem
id:
minimum-cost-flow-problem-187-14029680
title:
Minimum-cost flow problem
text:
The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated. The minimum cost flow problem is one of the most fundamental among all flow and circulation problems because most other such problems can be cast as a minimum
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical optimization problem
original url:
https://en.wikipedia.org/wiki/Minimum-cost_flow_problem
date created:
2006-09-02T06:57:14Z
date modified:
2024-09-08T15:12:11Z
main entity:
{"identifier":"Q2897180","url":"https://www.wikidata.org/entity/Q2897180"}
image:
fields total:
13
integrity:
15