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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Network biology Jg. 15; H. 2; S. 48 - 66
1. Verfasser: Tlas, Muhammad
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hong Kong International Academy of Ecology and Environmental Sciences (IAEES) 01.06.2025
International Academy of Ecology and Environmental Sciences
Schlagworte:
Algorithms
augmenting path method
Biology
Constraints
digraph
Graph theory
Labeling
Maximum flow
maximum flow problem
network flow
Nodes
polynomial time algorithm
scaling algorithm
Shortest-path problems
ISSN:2220-8879
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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 O(n2) Dijkstra's shortest path between two nodes in the defined residual network with n nodes and m arcs. It is proven that, the algorithm's complexity was estimated to be no more than O(n2mr) arithmetic operations in the worst case to reach the maximum vector flow through the directed network. Where r denotes to the smallest integer greater than or equal to log B, and B denotes to the largest arc capacity of the network. A numerical example has been illustrated using the proposed algorithm.
AbstractList 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 O(n^2) Dijkstra's shortest path between two nodes in the defined residual network with n nodes and m arcs. It is proven that, the algorithm's complexity was estimated to be no more than O(n2mr) arithmetic operations in the worst case to reach the maximum vector flow through the directed network. Where r denotes to the smallest integer greater than or equal to log B, and B denotes to the largest arc capacity of the network. A numerical example has been illustrated using the proposed algorithm.
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 O(n2) Dijkstra's shortest path between two nodes in the defined residual network with n nodes and m arcs. It is proven that, the algorithm's complexity was estimated to be no more than O(n2mr) arithmetic operations in the worst case to reach the maximum vector flow through the directed network. Where r denotes to the smallest integer greater than or equal to log B, and B denotes to the largest arc capacity of the network. A numerical example has been illustrated using the proposed algorithm.
Author Tlas, Muhammad
Author_xml – sequence: 1
  givenname: Muhammad
  surname: Tlas
  fullname: Tlas, Muhammad
BookMark eNotj8tqwzAURE1poWmafxB0bdDDtqRlCH0EAt1kb65kyZGxJVeW2wT68TVJV8MdZg53nrJ7H7y5y1aUUpwLweVjtpmmDmNMKJFMVKvsd4uUSzlEjTSMoF26oElD73yLoG9DdOk0IBsiSieDBji7YV7uPvygMQbVmwFNs-qMTqZBKSAVzkgHP6UIzqcJBX8tXgvfS2oBOY8a10YYT8_Zg4V-Mpt_XWfHt9fj7iM_fL7vd9tD3siC5YLxCgiUQkrCodQNq0opSisaromiWldK6FJpQQtMOAFDVFUIZthiYl5Zts72N2wToKvH6AaIlzqAq69GiG0NMTndm7qSygrecIutLbTFUFpoKlloVlBGrFpYLzfWsv5rNlOquzBHv3xfM4opoVQIxv4Ay3Z1lA
ContentType Journal Article
Copyright Copyright © 2025. This work is licensed under http://creativecommons.org/licenses/by/3.0/legalcode (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: Copyright © 2025. This work is licensed under http://creativecommons.org/licenses/by/3.0/legalcode (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 7QL
7SN
7T5
7TO
ABUWG
AEUYN
AFKRA
ATCPS
AZQEC
BENPR
BHPHI
BVBZV
C1K
CCPQU
DWQXO
GNUQQ
H94
HCIFZ
PATMY
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PYCSY
DOA
DatabaseName Bacteriology Abstracts (Microbiology B)
Ecology Abstracts
Immunology Abstracts
Oncogenes and Growth Factors Abstracts
ProQuest Central (Alumni)
ProQuest One Sustainability
ProQuest Central UK/Ireland
Agricultural & Environmental Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Natural Science Collection
East & South Asia Database (ProQuest)
Environmental Sciences and Pollution Management
ProQuest One Community College
ProQuest Central
ProQuest Central Student
AIDS and Cancer Research Abstracts
SciTech Premium Collection
Environmental Science Database
Proquest Central Premium
ProQuest One Academic (New)
ProQuest - Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Environmental Science Collection
DOAJ Directory of Open Access Journals
DatabaseTitle Publicly Available Content Database
ProQuest Central Student
Oncogenes and Growth Factors Abstracts
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
Environmental Sciences and Pollution Management
ProQuest Central
ProQuest One Sustainability
Natural Science Collection
ProQuest Central Korea
Bacteriology Abstracts (Microbiology B)
Agricultural & Environmental Science Collection
AIDS and Cancer Research Abstracts
ProQuest Central (New)
ProQuest One Academic Eastern Edition
Ecology Abstracts
East & South Asia Database
Environmental Science Collection
ProQuest One Academic UKI Edition
Environmental Science Database
Immunology Abstracts
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: ProQuest - Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 2220-8879
EndPage 66
ExternalDocumentID oai_doaj_org_article_69bf87d7f0ff4cf0a5fad694c34231fb
GroupedDBID 5VS
7QL
7SN
7T5
7TO
7XC
8FE
8FH
ABUWG
ADBBV
AEUYN
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ATCPS
AZQEC
BCNDV
BENPR
BHPHI
BPHCQ
BVBZV
C1K
CCPQU
DWQXO
FRP
GNUQQ
GROUPED_DOAJ
H94
HCIFZ
IAO
IEA
KQ8
M~E
OK1
PATMY
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PROAC
PUEGO
PYCSY
ID FETCH-LOGICAL-d943-8376a1a589917a5cd365985f8d7c1b2cc6b8c5bc8240171ae1b6483e3c5b076f3
IEDL.DBID BENPR
IngestDate Fri Oct 03 12:53:26 EDT 2025
Sat Aug 23 12:42:59 EDT 2025
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d943-8376a1a589917a5cd365985f8d7c1b2cc6b8c5bc8240171ae1b6483e3c5b076f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3202122883?pq-origsite=%requestingapplication%
PQID 3202122883
PQPubID 786384
PageCount 19
ParticipantIDs doaj_primary_oai_doaj_org_article_69bf87d7f0ff4cf0a5fad694c34231fb
proquest_journals_3202122883
PublicationCentury 2000
PublicationDate 20250601
2025-06-01
PublicationDateYYYYMMDD 2025-06-01
PublicationDate_xml – month: 06
  year: 2025
  text: 20250601
  day: 01
PublicationDecade 2020
PublicationPlace Hong Kong
PublicationPlace_xml – name: Hong Kong
PublicationTitle Network biology
PublicationYear 2025
Publisher International Academy of Ecology and Environmental Sciences (IAEES)
International Academy of Ecology and Environmental Sciences
Publisher_xml – name: International Academy of Ecology and Environmental Sciences (IAEES)
– name: International Academy of Ecology and Environmental Sciences
SSID ssj0001219386
Score 2.2930098
Snippet 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....
SourceID doaj
proquest
SourceType Open Website
Aggregation Database
StartPage 48
SubjectTerms Algorithms
augmenting path method
Biology
Constraints
digraph
Graph theory
Labeling
Maximum flow
maximum flow problem
network flow
Nodes
polynomial time algorithm
scaling algorithm
Shortest-path problems
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yFLyIP3E65R28FpumSZrjFMXT8LDDbiU_Gi1srazdnOAfb5J2MPDgxWMCIfBeku97j_B9CN0RjhNLsIm8lHmUUsMipYyIPJpQqxg1WAazCT6ZZLOZeN2x-vJ_wjp54C5w90wom3HDbWxtqm0sqZWGiVR76TpslX99Yy52iqmuu-KISbYV4v_1zgbweD5GRz3rg3G32wnaK6pTdND5QH6doe8xqLKN3JkD7cBLO2YMjQuegxWQ87faFfDvC3D0Ehxdg4XclIuVG8_rT-gNYaBZKd9RKQy0Nah6A9oTP-__0DZQV2FhWLAObXooKzBlUKs-R9Pnp-njS9TbIkRGpCRyFSWTWFJXKGEuqTaEUZFRmxmusUq0ZirTVOnMYTXmWBZYsTQjBXGTMWeWXKBBVVfFJQKWKi4VTYSxcWp1ITlRMaEuzppgLPQQPfjw5R-d8EXupajDhEtQ3ico_ytBQzTaBj_v70eTe9d2nHin46v_2OMaHSbelzd0R0Zo0C5XxQ3a1-u2bJa34Wj8APX0xP8
  priority: 102
  providerName: Directory of Open Access Journals
Title A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph
URI https://www.proquest.com/docview/3202122883
https://doaj.org/article/69bf87d7f0ff4cf0a5fad694c34231fb
Volume 15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  databaseCode: DOA
  dateStart: 20110101
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: https://www.doaj.org/
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  databaseCode: M~E
  dateStart: 20110101
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: East & South Asia Database (ProQuest)
  databaseCode: BVBZV
  dateStart: 20110501
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: https://search.proquest.com/eastsouthasia
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  databaseCode: PATMY
  dateStart: 20110501
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: http://search.proquest.com/environmentalscience
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest - Publicly Available Content Database
  databaseCode: PIMPY
  dateStart: 20110501
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: http://search.proquest.com/publiccontent
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  databaseCode: BENPR
  dateStart: 20110501
  customDbUrl:
  isFulltext: true
  eissn: 2220-8879
  dateEnd: 99991231
  titleUrlDefault: https://www.proquest.com/central
  omitProxy: false
  ssIdentifier: ssj0001219386
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT9wwELUotBIXoB-oUEBz6NVqHMd2cqoAgdoDq1XFgZ4if8Q0EpvQTRao1B_P2OsVSEi99OiJJpEy45nxS_QeIZ-5YrnnzNFAZU4L4SQ1xlU0dBPhjRSO6Sg2oSaT8uqqmibAbUi_Va5qYizUrrcBI_8SdL5ZHrRxv97-pkE1KnxdTRIar8hGYCrDPN84OZtMfzxDWdBargj5X9Tb2ETOt__38TtkK42PcLyM91uy1nTvyJuloOSf9-TvMZh2pJi8YLELWhyxYcAoYH8CfXONNxx_zQDnVMC5D2b6oZ0tcH3T30NSloFhYQI00zgYezD9A9gwQQYhiXGAvouO0eEu4v3QduDaSHv9gVyen12efqNJX4G6quAUj6ZSMy3wxMWUFtZxKapS-NIpy0xurTSlFcaW2PSZYrphRhYlbzgaMyU93yXrXd81HwnIwihtRF45nxXeNlpxk3HhC2s5xsXukZPw_uvbJYNGHTito6GfX9dpi9SyMr5UTvnMo6PPtPDayaqwgaSQebNHDlahqdNGG-qnuOz_-_InspkH6d4IoByQ9XG-aA7Ja3s3tsP8KOXNUTyS42r6_WL68xHWzdWY
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFL0qUxDd8GzVQgEvYGkRx7GTLFBVHlVHbUezmEVZRX7EbaROUiaZPiR-iX_stScRSEjsumAZRzey5aP7snMOwHuesthxZqmnMqeJsJJqbXPqo4lwWgrLVBCbSCeT7PQ0n67Br-FfGH-tcvCJwVHbxvge-Uev881ir427d_mDetUof7o6SGisYHFU3l5jydZ-Gn_F_f0QxwffZl8Oaa8qQG2ecIoFmVRMCawzWKqEsVyKPBMus6lhOjZG6swIbTIMdSxlqmRaJhkvOQ5ize84fvYBrCeI9WgE69PxyfT7H00dzIeygf__L_ceYtbB0_9stc_gSZ8ck_0Vmp_DWlm_gEcruczbl_Bzn-iqozgrYjDGGywgSIsYw-hL1MUZzr87nxPMwglmtWSubqr5Ep8vmmvS6-aQdql946m0pGuIbm6I8fmxl8noWtLUwTAYXIXTDFLVxFaB1HsTZvex8i0Y1U1dbgORiU6VFnFuXZQ4U6qU64gLlxjDGcvNDnz2211crvhBCs_YHQaaxVnRO4BC5tplqU1d5NDQRUo4ZWWeGE_ByJzegd0BCUXvRtriNwxe_fv1O3h8ODs5Lo7Hk6PXsBF7keLQKtqFUbdYlm_gobnqqnbxtocsgeKeYXMH4HItfA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+bit-arc+capacity+scaling+algorithm+for+the+maximum+flow+problem+subjected+to+box+constraints+on+the+flow+vector+in+digraph&rft.jtitle=Network+biology&rft.au=Tlas%2C+Muhammad&rft.date=2025-06-01&rft.pub=International+Academy+of+Ecology+and+Environmental+Sciences+%28IAEES%29&rft.eissn=2220-8879&rft.volume=15&rft.issue=2&rft.spage=48