Image by Tho-Ge on Pixabay · Pixabay License
In the Vinony graph
Vinony's link graph records 24 inbound references to 最小费用最大流问题, and connects out to Robert Tarjan, maximum flow problem and International Standard Book Number.
Vinony files it under Mathematical problems and Network flow problem.
Vinony links it to 11 Wikipedia language editions.
Wikidata facts
- Has use
- flow network
Show 2 more facts
- facet of
- operations research
- studied by
- graph theory
Sources (3)
via Wikidata · CC0
Article · 中文
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
Robert Tarjan
Entity
maximum flow problem
Entity
International Standard Book Number
Entity
digital object identifier
Entity
mathematical optimization
Entity
linear programming
Entity
binary search algorithm
Entity
if and only if
Entity
Richard M. Karp
Entity
simplex algorithm
Entity
directed graph
Entity
bipartite graph
Entity
decision problem
Entity
Bellman–Ford algorithm
Entity
Handle System
Entity
shortest path problem
Entity
CiteSeerX
Entity
matching
Entity
Ford–Fulkerson algorithm
Entity
flow network
Entity