Results 271 to 280 of about 218,505 (300)
Some of the next articles are maybe not open access.
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
Flow constrained minimum cost flow problem
OPSEARCH, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Minimum Concave Cost Flows in Certain Networks
Management Science, 1968The literature is replete with analyses of minimum cost flows in networks for which the cost of shipping from node to node is a linear function. However, the linear cost assumption is often not realistic. Situations in which there is a set-up charge, discounting, or efficiencies of scale give rise to concave functions.
openaire +2 more sources
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