Results 21 to 30 of about 279,848 (302)
Optimization of people evacuation plans on the basis of wireless sensor networks
Open Engineering, 2016 This paper introduces the optimization process for people salvation in critical situations by organizing their evacuation plan from enclosed areas using modern approaches of data acquisition on the basis of wireless sensor networks.
Amirgaliyev Yedilkhan +2 more
doaj +1 more source
A method for the solution of the homogeneous inventory-production optimisation problem
Technical Transactions, 2020 The subject of this paper is the inventory-production problem, which is a one of the optimization problems in a decision area in which inventory volume and production volume are considered together.
Schiff Krzysztof
doaj +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
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
Draining Algorithm for the Maximum Flow Problem
, 2009 A new augmenting path based algorithm called draining algorithm is proposed. For the maximum flow problem in this letter. Unlike other augmenting path based algorithms which augment gradually the flow from zero-flow to the maximum flow, the proposed ...
Zhong Chen +8 more
core +2 more sources
The maximum flow problem is log space complete for P
, 1982 The space complexity of the maximum flow problem is investigated. It is shown that the problem is log space complete for deterministic polynomial time. Thus the maximum flow problem probably has no algorithm which needs only O(logk n) storage space for ...
Goldschlager, Leslie M. +2 more
core +2 more sources
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
The maximum flow problem and its dual [PDF]
, 2012 本論文では,フローネットワーク最適化問題の1つとして有名な最大流問題に注目する.最大流問題とは,ネットワークにおいて2つの制約,容量制約と流量保存則のもとでフローの値が最大となるフローを見つける問題である.多くの組み合わせ最適化問題は線形計画問題(LP問題)として定式化され,最大流問題についてもLPへの定式化の方法は知られている.一方で,組み合わせ最適化問題において有名な定理,最大フロー・最小カットセット定理はネットワークにおけるフローとカットセットの双対性を表したものだと知られている ...
渡邊, 芳英 +17 more
core +1 more source
MAXIMUM FLOW PROBLEM IN ETHIOPIAN AIRLINES
, 2016 Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The problem is to find the maximum flow that can be sent through the arcs of the network from some specified node S, called the source, to a second specified ...
Haftom Gebreanenya, Gebreanenya, Haftom
core +1 more source