Results 21 to 30 of about 270,354 (261)
Optimal Decision-Making Dealing with Enemy Sabotages Using the Maximum Flow Interdiction Problem in Multi-Period Dynamic Networks in Fuzzy Conditions [PDF]
آیندهپژوهی دفاعی, 2022 For a long time, one of the most important problems in wars has been the enemy's operations to destroy facilities and communication networks. The destruction of bridges and roads, air, missile, or artillery attacks, and the countless cyber-attacks in ...
Hamid Bigdeli, Salim Bavandi
doaj +1 more source
On the maximum capacity augmentation algorithm for the maximum flow problem
Discrete Applied Mathematics, 1993 The subject of this paper is two variants of the classical path- augmentation algorithm for maximum capacitated flow problem. The main point of the paper is that both algorithms have polynomial bounds even when the capacities have real values. The first bound is \(O(m^ 2\log m)\) flow augmentations and \(O(m^ 3\log m)\) operations.
Donald Goldfarb, Jianxiu Hao
openaire +1 more source
Coordinator MPC for maximizing plant throughput [PDF]
Modeling, Identification and Control, 2008 In many cases economic optimal operation is the same as maximum plant throughput, which is the same as maximum flow through the bottleneck(s). This insight may greatly simplify implementation. In this paper, we consider the case where the bottlenecks may
Elvira M.B. Aske +2 more
doaj +1 more source
Inverse Generalized Maximum Flow Problems
Mathematics, 2019 A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities
Javad Tayyebi, Adrian Deaconu
doaj +1 more source
Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities
Promet (Zagreb), 2021 This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable).
Marko Špoljarec, Robert Manger
doaj +1 more source
Flows in Generalized Nets with Related Arcs
Моделирование и анализ информационных систем, 2015 The problem of finding the maximum flow in nets of a special form is considered. In such nets the arcs are related in such a way that the total flow passing through the related arcs does not exceed the minimum throughput of these arcs.
V. A. Skorokhodov
doaj +3 more sources
Novel GPU-Based Method for the Generalized Maximum Flow Problem
ComputationThis paper investigates the application of a minimum loss path finding algorithm to determine the maximum flow in generalized networks that are characterized by arc losses or gains.
Delia Elena Spridon +2 more
doaj +1 more source
Playing with the Maximum-Flow Problem
EPiC Series in Computing, 2018 In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. The problem has been extensively used in order to optimize the performance of networks in numerous application areas.
openaire +2 more sources
Heat transportation enrichment and elliptic cylindrical solution of time-dependent flow
Case Studies in Thermal Engineering, 2021 The main focus of this article is to examine the effects of heat transfer for a compressible time-dependent laminar flow pass the two distinctly positioned elliptic cylinders. The Mac number is chosen below 0.3 to keep the flow laminar. The heat transfer
Azad Hussain +6 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Anthracycline‐related cardiac remodeling precedes heart failure in childhood cancer survivors. The objectives of this study were to determine the relationships between patient‐specific factors, moderate‐to‐vigorous physical activity (MVPA), and cardiac remodeling.
Hari K. Narayan +15 more
wiley +1 more source