Closed parasitic flow loops and dominated loops in networks
- Submitting institution
-
Oxford Brookes University
- Unit of assessment
- 12 - Engineering
- Output identifier
- 185750819
- Type
- D - Journal article
- DOI
-
10.1504/IJOR.2019.104057
- Title of journal
- International Journal of Operational Research
- Article number
- -
- First page
- 555
- Volume
- 36
- Issue
- 4
- ISSN
- 1745-7645
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper discovered the presence of closed parasitic flow loops in any published algorithm for maximising the throughput flow in networks since the start of the flow networks research in 1956. Parasitic flow loops increase the cost of transportation of flow unnecessarily, and consume residual capacity from the edges of the network. The paper is of fundamental significance to the theory of flow networks because parasitic flow loops in networks remained unnoticed by all researchers working in this important field. This research resulted in a well-received talk in the international operational research conference in Rotherdam in 2016.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -