Skip to search formSkip to main contentSkip to account menu

Minimum-cost flow problem

Known as: Minimum cost flow problem, Min cost flow, Minimum cost maximum flow problem 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Given a network N(V, A, u, c) and a feasible flow x0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym… 
2009
2009
In this paper, we describe and solve the problem of establishing a minimum cost flow in networks with node capacities. We show… 
2009
2009
  • Rui MaoJinfu Zhu
  • 2009
  • Corpus ID: 18630886
The problem that finding the minimum cost flow in uncertain environments is become more and more outstanding. The cost… 
2007
2007
The author study the minimum cost flow problem with not only fixed cost but also variable cost,and they found it be a mixed 0-1… 
2006
2006
Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological… 
2005
2005
The model of layout of single variety network flow is built for many actual problem, but variety problem is more universal. The… 
2005
2005
We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is… 
Highly Cited
2005
Highly Cited
2005
Physical phenomena such as temperature have an increasingly important role in performance and reliability of modern process… 
2004
2004
  • S. Krile
  • 2004
  • Corpus ID: 1968499
In This work the efficient algorithm for optimal cargo transport of N types of containers with limited ship capacity, minimizing… 
2003
2003
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is…