Results 271 to 280 of about 356,172 (299)
Some of the next articles are maybe not open access.
Minimum-Cost Multicommodity Network Flows
Operations Research, 1966The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.
openaire +1 more source
Minimum cost dynamic flows: The series-parallel case
Networks, 1995AbstractA dynamic network consists of a directed graph with capacities, costs, and integral transit times on the arcs. In the minimum‐cost dynamic flow problem (MCDFP), the goal is to compute, for a given dynamic network with source s, sink t, and two integers v and T, a feasible dynamic flow from s to t of value v, obeying the time bound T, and having
Klinz, Bettina, Woeginger, Gerhard
openaire +2 more sources
Flow constrained minimum cost flow problem
OPSEARCH, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Minimum Cost Source Location Problems with Flow Requirements
Algorithmica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariko Sakashita +2 more
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 flow algorithms: an experimental evaluation
Optimization Methods and Software, 2014An extensive computational analysis of several algorithms for solving the minimum-cost network flow problem is conducted. Some of the considered implementations were developed by the author and are available as part of an open-source C++ optimization library called LEMON (http://lemon.cs.elte.hu/).
openaire +1 more source
Target Controllability in Multilayer Networks via Minimum-Cost Maximum-Flow Method
IEEE Transactions on Neural Networks and Learning Systems, 2021Jie Ding, Changyun Wen, Guoqi Li
exaly
Calibrated Recommendations as a Minimum-Cost Flow Problem
Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023Himan Abdollahpouri +8 more
openaire +1 more source
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions
INFORMS Journal on Computing, 2023Mehdi Ansari +2 more
exaly