Minimum cost flow problem with conflicts
Networks, 2021 AbstractThe minimum cost flow problem with conflicts is a recent extension of the ordinary minimum cost flow problem. It includes flow compatibility restrictions in addition to flow balance equalities and capacity constraints: at most one of the conflicting arcs can have positive flow.
Necati Aras, I Kuban Altınel
exaly +5 more sources
Robust minimum cost flow problem under consistent flow constraints [PDF]
Annals of Operations Research, 2021 AbstractThe robust minimum cost flow problem under consistent flow constraints (RobMCF$$\equiv $$ ≡ ) is a new extension of the minimum cost flow (MCF) problem. In the RobMCF$$\equiv $$ ≡ problem, we consider demand and supply that are subject to uncertainty.
Christina Busing +2 more
exaly +7 more sources
Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms [PDF]
SensorsThis paper formulates the “Minimum Vertex Cut with Reachable Set” (MVCRS) problem as an optimization framework to suppress botnet propagation in networked systems, and clarifies its computational complexity and algorithmic solutions.
Shingo Yamaguchi
doaj +2 more sources
Optimal Diagnosis Strategy via Functional Extremum Transformation and Fault Elimination Neural Network: A Minimum Diagnosis-Cost Approach for Complex Systems [PDF]
SensorsFor complex systems with complex structures and limited fault data, expert knowledge-based methods are often preferred. The multi-signal flow graph model is a representative qualitative approach, but generating a minimum-cost diagnostic strategy under ...
Yuanzhang Su +5 more
doaj +2 more sources
Solving biobjective network flow problem associated with minimum cost-time loading [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We apply a primal-dual simplex algorithm for solving the biobjective min imum cost-time network flow problem such that the total shipping cost and the total shipping fixed time are considered as the first and second objective functions, respectively.
O. Baghani, S. Ghafoori
doaj +1 more source
Capacity inverse minimum cost flow problem [PDF]
Journal of Combinatorial Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Güler, Cigdem, Hamacher, Horst
openaire +2 more sources
A dual exterior point simplex type algorithm for the minimum cost network flow problem [PDF]
Yugoslav Journal of Operations Research, 2009 A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category.
Geranis George +2 more
doaj +1 more source
Flow Increment through Network Expansion
Mathematics, 2021 The network expansion problem is a very important practical optimization problem when there is a need to increment the flow through an existing network of transportation, electricity, water, gas, etc.
Adrian Marius Deaconu, Luciana Majercsik
doaj +1 more source
A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]
Network Biology, 2021 A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj
Optimization of container traffic distribution on the railway network [PDF]
E3S Web of Conferences, 2022 The paper considers the problem of optimal redistribution of transit container flows on the railway network. The problem is proposed to be solved as the problem of a multi-commodity flow of minimum cost using the relaxation method.
Kisselyova Olga +4 more
doaj +1 more source