Results 211 to 220 of about 213,560 (261)
Some of the next articles are maybe not open access.
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
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
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
On minimum reload cost paths, tours, and flows
Networks, 2010AbstractThe concept of reload cost, that is of a cost incurred when two consecutive arcs along a path are of different types, naturally arises in a variety of applications related to transportation, telecommunication, and energy networks. Previous work on reload costs is devoted to the problem of finding a spanning tree of minimum reload cost diameter (
AMALDI, EDOARDO +2 more
openaire +2 more sources
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