Results 261 to 270 of about 87,677 (298)
Some of the next articles are maybe not open access.
The budgeted minimum cost flow problem with unit upgrading cost
Networks, 2016The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing one to reduce the cost of at most K arcs. In this article, we consider complexity and algorithms for the special case of an uncapacitated network with just one source.
Christina Büsing +3 more
openaire +2 more sources
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem [PDF]
European Journal of Operational Research, 2015 We present a column generation algorithm for solving the bi-objective multi-commodity minimum cost flow problem. This method is based on the bi-objective simplex method and Dantzig–Wolfe decomposition.
Siamak Moradi +2 more
exaly +1 more source
Flow constrained minimum cost flow problem
OPSEARCH, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Multi-player minimum cost flow problems with nonconvex costs and integer flows
2016 IEEE 55th Conference on Decision and Control (CDC), 2016In this paper we consider a variant of the well known minimum cost flow problem in a directed network with nonconvex costs and integer flows. We formulate the problem in a multi-player setup, whereby we associate one player with each arc of the network.
Shuvomoy Das Gupta, Lacra Pavel
openaire +1 more source
Solving minimum-cost flow problems by successive approximation
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amount that the complementary slackness conditions are violated. We show how to extend techniques developed for the maximum flow problem to improve the quality of a solution. This framework allows us to achieve O(min(n3, n5/3 m2/3, nm
Andrew V. Goldberg, Robert Endre Tarjan
openaire +1 more source
1991
The minimum-cost flow problem defined on a directed graph G = (V,A) is that of finding a feasible flow of minimum cost. In addition to the maximum flow problem, each arc (i,j) e A has associated an integer c(i,j) referred to as cost per unit of flow. Let b: V ↦ R be the demand-supply vector, where b(j) 0 if j is a destination vertex, and b(j) = 0 for
openaire +1 more source
The minimum-cost flow problem defined on a directed graph G = (V,A) is that of finding a feasible flow of minimum cost. In addition to the maximum flow problem, each arc (i,j) e A has associated an integer c(i,j) referred to as cost per unit of flow. Let b: V ↦ R be the demand-supply vector, where b(j) 0 if j is a destination vertex, and b(j) = 0 for
openaire +1 more source
Minimum cost time-varying network flow problems
Optimization Methods and Software, 2010This paper deals with a general minimum cost dynamic flow problem in a discrete time model with time-varying transit times, transit costs, transit capacities, storage costs, and storage capacities. For this problem, an algorithm of time complexity O(V nT(n+T)) is presented, where V is an upper bound on the total supply, n is the number of nodes, and T ...
Ebrahim Nasrabadi, S. Mehdi Hashemi
openaire +1 more source
An algorithm for the biobjective integer minimum cost flow problem
Computers & Operations Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda +1 more
openaire +1 more source
Efficient Parallel Algorithms for the Minimum Cost Flow Problem
Journal of Optimization Theory and Applications, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BERALDI, Patrizia +2 more
openaire +2 more sources
Possibilistic Minimum-cost Flow Problem
2001To illustrate the applications of the proposed fuzzy approaches, the minimum-cost flow (MCF) problem was investigated and several examples were solved. Minimum-cost flow problem is a general form of network flow problem, whose aim is to find the least cost of shipments of commodities through capacitated network in order to satisfy demands at certain ...
E. Stanley Lee, Hsu-shih Shih
openaire +1 more source