Results 221 to 230 of about 213,568 (263)
Some of the next articles are maybe not open access.
2000
In this chapter we show how we can take edge costs into account. For example, in our application of the MAXIMUM FLOW PROBLEM to the JOB ASSIGNMENT PROBLEM mentioned in the introduction of Chapter 8 one could introduce edge costs to model that the employees have different salaries; our goal is to meet a deadline when all jobs must be finished at a ...
Bernhard Korte, Jens Vygen
openaire +1 more source
In this chapter we show how we can take edge costs into account. For example, in our application of the MAXIMUM FLOW PROBLEM to the JOB ASSIGNMENT PROBLEM mentioned in the introduction of Chapter 8 one could introduce edge costs to model that the employees have different salaries; our goal is to meet a deadline when all jobs must be finished at a ...
Bernhard Korte, Jens Vygen
openaire +1 more source
Minimum-Cost Flows in Unit-Capacity Networks
Theory of Computing Systems, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrew V. Goldberg +3 more
openaire +2 more sources
2009
Recall application 5 (page 4), modeled by the network in Fig. 1.2. If we consider the edge costs as distances we can compute the optimal production plan for period j as a shortest path. If we have capacities on the edges as well, the problem becomes a combination of a shortest path and a flow problem called a min-cost-flow-problem, which is the kind of
Winfried Hochstättler +1 more
openaire +1 more source
Recall application 5 (page 4), modeled by the network in Fig. 1.2. If we consider the edge costs as distances we can compute the optimal production plan for period j as a shortest path. If we have capacities on the edges as well, the problem becomes a combination of a shortest path and a flow problem called a min-cost-flow-problem, which is the kind of
Winfried Hochstättler +1 more
openaire +1 more source
Minimum cost flow‐dependent communication networks
Networks, 2006AbstractIn the construction of a communication network, the (Euclidean) length of the network is an important but not unique factor determining the cost of the network. Among many possible network models, Gilbert proposed a flow‐dependent model in which flow demands are assigned between each pair of points in a given point set A, and the cost per unit ...
Doreen A. Thomas, Jia F. Weng
openaire +2 more sources
Minimum cost multi-product flow lines
Annals of Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ALFIERI, Arianna, G. NICOSIA
openaire +2 more sources
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
On dual minimum cost flow algorithms
Mathematical Methods of Operations Research (ZOR), 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Uncertain minimum cost flow problem
Soft Computing, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
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