Results 261 to 270 of about 218,505 (300)
Some of the next articles are maybe not open access.
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
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
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
Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications
Operations Research, 2010 The objective of the classical minimum cost flow problem is to send units of a good that reside at one or more points in a network (sources or supply nodes) with arc capacities to one or more other points in the network (sinks or demand nodes ...
Ravindra K Ahuja
exaly +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
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
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 flow problems having arc‐activation costs
Naval Research Logistics (NRL), 2021AbstractTime‐dependent network applications, such as wireless sensor network and infrastructure optimization settings, may require dynamic flows to be transmitted according to a nonsimultaneous schedule of path‐flows. We study a dynamic network flow optimization problem considering the presence of activation costs required to begin transmitting flow on
Robert M. Curry, J. Cole Smith
openaire +2 more sources