Results 251 to 260 of about 218,505 (300)
Some of the next articles are maybe not open access.
Time-varying minimum cost flow problems
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoqiang Cai, Dan Sha, C. K. Wong
exaly +3 more sources
Uncertain minimum cost multicommodity flow problem
Soft Computing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sibo Ding
exaly +2 more sources
A note on the minimum interval cost flow problem
Applied Mathematics and Computation, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamed Daneshpajouh, Mohsen Alimomeni
exaly +3 more sources
Ameliorative Minimum Cost Flow Algorithm for Phase Unwrapping
Procedia Environmental Sciences, 2011 Ameliorative minimum cost flow algorithm is put forward in this paper Based on MCF,. As we all know, MCF is one phase unwrapping algorithm based on network flow and it is used widely because of many merits.
Ting-chen, Jiang
exaly +2 more sources
Minimum cost flows with minimum quantities
Information Processing Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sven Oliver Krumke, Clemens Thielen
openaire +2 more sources
Budget-constrained minimum cost flows
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Holzhauser +2 more
openaire +1 more source
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs
Mathematics of Operations Research, 2022We develop algorithms solving parametric flow problems with separable, continuous, piecewise quadratic, and strictly convex cost functions. The parameter to be considered is a common multiplier on the demand of all nodes. Our algorithms compute a family of flows that are each feasible for the respective demand and minimize the costs among the feasible
Max Klimm, Philipp Warode
openaire +1 more source
The biobjective minimum cost flow problem
European Journal of Operational Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda +1 more
openaire +2 more sources
Approximating the minimum-cost maximum flow is P-complete
Information Processing Letters, 1992 We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unless P = NC. Keywords: Theory of computation, P-complete, minimum-cost flow, maximum flow.
Clifford Stein
exaly +1 more source
Minimum cost flow with set‐constraints
Networks, 1982AbstractThe minimum cost network flow problem with set‐constraints is a generalization of the well‐known minimum cost network flow problem, in which bounds on the sum of flows through sets of arcs exist. This paper investigates some variations of this problem, including the polymatroid intersection problem, where for each node two polymatroids are ...
openaire +1 more source