Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

مساله کم‌هزینه‌ترین جریان · Vinony

Home
Mathematical problems
مساله کم‌هزینه‌ترین جریان

🌐فارسی

English Deutsch Français Italiano Português Русский فارسی 中文日本語

مساله کم‌هزینه‌ترین جریان

EntityQ2897180· pop 11· linked from 24 articles

مساله کم‌هزینه‌ترین جریان

Also known as MCF, MCFP

mathematical optimization problem

Available in 11 languages

Français
Deutsch
中文
日本語
Русский
Português
Italiano
Hebrew
Serbian

Connections

maximum flow problem

Categories

Mathematical problems Network flow problem

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

via Wikidata sitelinks · CC0

International Standard Book Number

Entity

digital object identifier

mathematical optimization

linear programming

binary search algorithm

Richard M. Karp

simplex algorithm

bipartite graph

decision problem

Bellman–Ford algorithm

shortest path problem

Ford–Fulkerson algorithm

Sign in to save

What links here24 pages

mathematical problem

Johnson's algorithm

Bellman–Ford algorithm

route inspection problem

maximum flow problem

push–relabel maximum flow algorithm

unimodular matrix

assignment problem

Congestion game

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

maximum flow problem

Entitydist 0.29

Flow Shop Scheduling Problem

Entitydist 0.30

nonlinear programming

Entitydist 0.37

constrained optimization

Entitydist 0.43

geometric programming

Entitydist 0.44

Facility location

Entitydist 0.44

Quadratic assignment problem

Entitydist 0.47

Karush–Kuhn–Tucker conditions

Entitydist 0.48

integer programming

Entitydist 0.48

Entitydist 0.49

optimal control

Entitydist 0.49

Lagrangian and Eulerian specification of the flow field

Entitydist 0.49