Inverse feasibility problems of the inverse maximum flow problems

Sadhana ◽  
2013 ◽  
Author(s):  
ADRIAN DEACONU ◽  
ELEONOR CIUREA
Keyword(s):  
Maximum Flow ◽  
Flow Problems

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.

scholarly journals Resource allocation problem in project management

2019 ◽  
Vol 97 ◽  
pp. 01003 ◽  
Author(s):  
Irina Burkova ◽  
Boris Titarenko ◽  
Amir Hasnaoui ◽  
Roman Titarenko
Keyword(s):  
Resource Allocation ◽  
Project Management ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Maximum Flow ◽  
Allocation Problem ◽  
Real Problem ◽  
Resource Allocation Problem ◽  
Flow Problems ◽  
Solution Methods

Resource allocation problems in project management are notoriously complex. Therefore the development of efficient algorithms for solving various specific cases is a real problem. This paper shows a specific case of the problem, where a program has a particular structure. The resource allocation problem in such a program is reduced to classical Johnson’s problem or job-shop scheduling problem. Effective solution methods, by way of reducing to maximum flow problems, are suggested for some types of resources. For other cases, heuristic rules are developed, with a description of the situations in which these rules allow good enough solutions to be obtained.

Complexity analysis for maximum flow problems with arc reversals

2008 ◽  
Vol 19 (2) ◽  
pp. 200-216 ◽  
Author(s):  
Steffen Rebennack ◽  
Ashwin Arulselvan ◽  
Lily Elefteriadou ◽  
Panos M. Pardalos
Keyword(s):  
Complexity Analysis ◽  
Maximum Flow ◽  
Flow Problems

scholarly journals Shortest path and maximum flow problems in networks with additive losses and gains

2011 ◽  
Vol 412 (4-5) ◽  
pp. 391-401 ◽  
Author(s):  
Franz J. Brandenburg ◽  
Mao-cheng Cai
Keyword(s):  
Shortest Path ◽  
Maximum Flow ◽  
Flow Problems

scholarly journals Time-varying universal maximum flow problems

2001 ◽  
Vol 33 (4-5) ◽  
pp. 407-430 ◽  
Author(s):  
X. Cai ◽  
D. Sha ◽  
C.K. Wong
Keyword(s):  
Maximum Flow ◽  
Time Varying ◽  
Flow Problems

On the complexity of preflow-push algorithms for maximum-flow problems

Algorithmica ◽  
1994 ◽  
Vol 11 (4) ◽  
pp. 353-359 ◽  
Author(s):  
Levent Tun�el
Keyword(s):  
Maximum Flow ◽  
Flow Problems
Sign in / Sign up

Export Citation Format

Share Document