Results 21 to 30 of about 88,447 (299)
This paper deals with the multiobjective minimum cost flow (F-MOMCF) with fuzzy penalty characterized by trapezoidal fuzzy numbers. Through the use of α-cut, the F-MOMCF problem is transformed into the α-MOMCF problem.
Majed G. Alharbi +2 more
doaj +1 more source
A Bi-Objective Minimum Cost-Time Network Flow Problem [PDF]
The Minimum Cost-Time Network Flow (MCTNF) problem deals with shipping the available supply through the directed network to satisfy demand at minimal total cost and minimal total time.
Keshavarz, Esmaiel, Toloo, Mehdi
core +1 more source
Traffic flow consideration in design of freight distribution system
This study is part of a series of research projects on a distribution system we developed to deal with cases in a state-owned company. It concerns the design of the Public Service Obligation State-owned Company (PSO-SOC) distribution system.
Sutanto Soehodho, Nahry
doaj +1 more source
The Feasibility of the Capacity Inverse Minimum Cost Flow Problem [PDF]
针对容量型最小费用流逆问题的可行性及相关优化进行研究,证明了判断容量型最小费用流逆问题是否可行可以在多项式时间内完成.如果容量型最小费用流逆问题; 不可行,即无论怎样修改容量的上界u和下界l,初始流${f^0}$都不能变为新网络的最小费用流.给出了两种调整初始流${f^0}$的算法,证明了通; 过最少修改初始流${f^0}$,可以使最小费用流逆问题变为可行.This paper studies the feasibility of the capacity inverse minimum cost ...
崔佳, 刘龙城, 李超
core +1 more source
New Algorithm Permitting the Construction of an Effective Spanning Tree
In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-chosen ...
Belkacem Salima Nait, Abbas Moncef
doaj +1 more source
Target tracker based on minimum cost flow modeling
A tracker using the method of minimum cost flow was designed to solve the problems of object occlusion, lighting effects and clutter disturbance. This tracker combines integer programming with the minimum cost flow model, and converts the prob-lem of ...
XI Zheng-hao +4 more
doaj +1 more source
Trade-offs between Risk and Operational Cost in SDN Failure Recovery Plan
We consider the problem of SDN flow optimization in the presence of a dynamic probabilistic link failures model. We introduce a metric for path risk, which can change dynamically as network conditions and failure probabilities change.
Saeed A. Astaneh +3 more
doaj +1 more source
A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA [PDF]
In particular, imprecise observations or possible perturbations mean that data in a network flows may well be better represented by intervals or fuzzy numbers than crisp quantities.
MEHDI GHIYASVAND
core +1 more source
Quantum optimization methods in water flow control [PDF]
This paper examines the problem of optimizing water flow control in order to minimize costs, represented as the square of the water flow. This takes into account restrictions on this flow, such as the maximum flow value.
Muhamediyeva Dilnoz +3 more
doaj +1 more source
Parallel algorithms for the assignment and minimum-cost flow problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James B. Orlin, Clifford Stein 0001
openaire +3 more sources

