Balancing Applied to Maximum Network Flow Problems

2006 ◽  
pp. 612-623 ◽  
Author(s):  
Robert Tarjan ◽  
Julie Ward ◽  
Bin Zhang ◽  
Yunhong Zhou ◽  
Jia Mao
Keyword(s):  
Network Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Maximum Network Flow

scholarly journals Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Random Network ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Network Flow Problems ◽  
Commodity Flow ◽  
Vast Number ◽  
Flow Problems ◽  
Execution Speed

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

scholarly journals Constraint Generation for Two-Stage Robust Network Flow Problems

2019 ◽  
Vol 1 (1) ◽  
pp. 49-70 ◽  
Author(s):  
David Simchi-Levi ◽  
He Wang ◽  
Yehua Wei
Keyword(s):  
Network Flow ◽  
Network Flow Problems ◽  
Two Stage ◽  
Constraint Generation ◽  
Flow Problems ◽  
Robust Network

scholarly journals Combinatorial algorithms for inverse network flow problems

Networks ◽  
2002 ◽  
Vol 40 (4) ◽  
pp. 181-187 ◽  
Author(s):  
Ravindra K. Ahuja ◽  
James B. Orlin
Keyword(s):  
Network Flow ◽  
Combinatorial Algorithms ◽  
Network Flow Problems ◽  
Flow Problems

Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

2011 ◽  
Vol 25 (1) ◽  
pp. 99-122 ◽  
Author(s):  
Alexey Sorokin ◽  
Vladimir Boginski ◽  
Artyom Nahapetyan ◽  
Panos M. Pardalos
Keyword(s):  
Risk Management ◽  
Network Flow ◽  
Fixed Charge ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Management Techniques ◽  
Arc Failures

Network Flow Problems

2000 ◽  
pp. 133-177
Author(s):  
Horst W. Hamacher ◽  
Kathrin Klamroth
Keyword(s):  
Network Flow ◽  
Network Flow Problems ◽  
Flow Problems
Sign in / Sign up

Export Citation Format

Share Document