A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph
A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two. It solves the maximal flow problem as a sequence of...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Academy of Ecology and Environmental Sciences
2025-06-01
|
| Series: | Network Biology |
| Subjects: | |
| Online Access: | http://www.iaees.org/publications/journals/nb/articles/2025-15(2)/a-bit-arc-capacity-scaling-algorithm.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|