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)

Related topics

Related topics

16 relations
Andrew V. GoldbergBend minimizationDecision problemDirected graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Capacity inverse minimum cost flow problems under the weighted Hamming distance
Given a network N(V, A, u, c) and a feasible flow x0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym… 
2010
2010
Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications
The objective of the classical minimum cost flow problem is to send units of a good that reside at one or more points in a… 
2009
2009
About minimum cost flow problem in networks with node capacities
In this paper, we describe and solve the problem of establishing a minimum cost flow in networks with node capacities. We show… 
2007
2007
Study on Capacitated Minimum Cost Flow Problem with Genetic Algorithm
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
Context Comparison as a Minimum Cost Flow Problem
Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological… 
2005
2005
Research on Solving Various Commodity Minimum Cost Flow Problem
The model of layout of single variety network flow is built for many actual problem, but variety problem is more universal. The… 
Highly Cited
2005
Highly Cited
2005
Temperature-aware resource allocation and binding in high-level synthesis
Physical phenomena such as temperature have an increasingly important role in performance and reliability of modern process… 
2005
2005
Solving the undirected minimum cost flow problem with arbitrary costs
We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is… 
2004
2004
Application of the minimum cost flow problem in container shipping
  • S. Krile
  • Proceedings. Elmar-. 46th International Symposium…
  • 2004
  • Corpus ID: 1968499
In This work the efficient algorithm for optimal cargo transport of N types of containers with limited ship capacity, minimizing… 
1990
1990
PARALLEL ASYNCHRONOUS PRIMAL-DUAL METHODS FOR THE MINIMUM COST FLOW PROBLEM'
In this paper we discuss the parallel asynchronous implementation of the classical primal-dual method for solving the linear… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)