Results 221 to 230 of about 213,560 (261)
Some of the next articles are maybe not open access.
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 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
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
Minimum Convex Cost Dynamic Network Flows
Mathematics of Operations Research, 1984This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it.
openaire +2 more sources
MINIMUM-COST FLOWS IN CONVEX-COST NETWORKS
Naval Research Logistics Quarterly, 1966AbstractAn algorithm is given for solving minimum‐cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas.
openaire +2 more sources
Multi-player minimum cost flow problems with nonconvex costs and integer flows
2016 IEEE 55th Conference on Decision and Control (CDC), 2016In this paper we consider a variant of the well known minimum cost flow problem in a directed network with nonconvex costs and integer flows. We formulate the problem in a multi-player setup, whereby we associate one player with each arc of the network.
Shuvomoy Das Gupta, Lacra Pavel
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