Network flow
Flood routing model for water resources optimization models based on a network flow
... Flood Routing Model for Water Resources Optimization Models based on a Network Flow Ayoub TAHIRI 1,2 , Daniel C. CHE 3 , David LADEVEZE 2 , Pascale CHIRON 1 , Bernard ARCHIMEDE 1 1 Laboratory of Industrial ...
2
Auction algorithms for network flow problems : a tutorial introduction
... The auction algorithm can be extended to solve a variety of other linear network flow problems such as transportation, transhipment, max-flow, and shortest path.. Th[r] ...
15
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
... minimum-cost network flow problem – a corner stone in the development of theory of polynomial time algorithms for optimization problems as well as widely used in practice of operations ...underlying ...
35
Nash Equilibria for multi-agent network flow with controllable capacities
... multi-agent network flow problem is addressed where a set of transportation-agents can control the capacities of a set of elementary routes A third-party agent, a customer, is interesting in maximizing the ...
17
About Casting 2D-Bin Packing into Network Flow Theory
... particular network flow problem and to provide us with some tips about the design of new algorithms for this ...the Network Flow ...2-multicommodity flow submitted to a no circuit ...
15
Belief Propagation for Min-Cost Network Flow: Convergence & Correctness
... Min-cost Network Flow: Convergence & Correctness David Gamarnik ∗ Devavrat Shah † Yehua Wei ‡ Abstract We formulate a Belief Propagation (BP) algorithm in the context of the capacitated minimum-cost ...
15
Reservoir management using a network flow optimization model considering quadratic convex cost functions on arcs
... different network flow algorithms (Out-of-Kilter, RELAX-IV and NETFLO) for solving the optimal alloca- tion of water resources taking into account two non-network constraints: evaporation from ...
15
Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem
... In this paper, we propose a mixed integer linear program to allocate internal material handling resources (straddle carriers) to different vehicles arriving at a terminal. Our objective is to minimize vehicle delays with ...
15
Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow
... y ≥ 0 has for all integral vectors d ∈ Z A + an integral optimum. To conclude: the latter results form an example par excellence in the field of so- called Polyhedral Combinatorics, a powerful, coherent and unifying tool ...
40
Asynchronous iterative algorithms with flexible communication for nonlinear network flow problems
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
34
Adaptive network flow with $k$-Arc Destruction
... the network with three vertices s, v, t with b arcs of capacity 1 from the source s to v and two arcs of capacity b between v to the sink ...The flow ϕ where there is 1 unit of flow for all the (s, ...
4
An auction/sequential shortest path algorithm for the minimum cost network flow problem
... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ...
20
Asynchronous gradient algorithms for a class of convex separable network flow problems
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
29
The auction algorithm for the minimum cost network flow problem
... To show that the number of substantive price rises per iteration is finite, note that with each substantive price rise, the reject capacity of either node i or a n[r] ...
32
Auction algorithms for network flow problems : a tutorial introduction
... A slight variation of the auction algorithm can be used for asymmetric assignment problems where the number of persons is m and the number of objects is n with m[r] ...
53
Optimization of Underground Stope with Network Flow Method
... Authors : Xiaoyu Bai, Denis Marcotte and Richard Simon 3.1 Abstract A new algorithm to optimize stope design for the sublevel stoping mining method is descri- bed. The model is based on a cylindrical coordinate defined ...
110
Combinatorial algorithms for inverse network flow problems
... Inverse optimization problems have been investigated rather extensively in the past few years, and inverse versions of the following problems have been studied: shor[r] ...
27
The auction algorithm for assignment and other network flow problems
... In the auction algorithm presented so far, only one person can bid at each round; this version of the auction algorithm is known as the one-at-a-time or Gauss-Seid[r] ...
18
Study of drought impact on inland navigation systems based on a flow network model
... navigation network dynamics with different time and spatial ...the network that are the most ...A flow network model is used to simulate the determined drought ...scenarios. Network ...
7
A flood decrease strategy based on flow network coupled with a hydraulic simulation software
... 1. INTRODUCTION A flood is an overflow water that submerges land which is generally dry. It usually happens as an overflow of water from the low-flow channel of a river. In order to divert or block the excess of ...
7