COMPUTING MAX FLOWS THROUGH CUT NODES
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300437 |
Resumo: | ABSTRACT In this work, the presence of cut nodes in a network is exploited to propose a competitive method for the multi-terminal maximum flow problem. The main idea of the method is based on the relation between cut-trees and cut nodes, which is observed in the context of sensitivity analysis on the variation of edges capacities. Computational experiments were conducted with the proposed algorithm, whose results were compared with the ones of Gusfield, for randomly generated and well-known instances of the literature. The numerical results demonstrate the potential of the method for some classes of instances. Moreover, the proposed method was adapted for the single maximum flow problem, but failed to improve existing running times for the very same classes of instances. |
id |
SOBRAPO-1_93ec012fc44f4d95759763d8c04b9e0d |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382017000300437 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
COMPUTING MAX FLOWS THROUGH CUT NODESmaximum flowcut-treecut nodesABSTRACT In this work, the presence of cut nodes in a network is exploited to propose a competitive method for the multi-terminal maximum flow problem. The main idea of the method is based on the relation between cut-trees and cut nodes, which is observed in the context of sensitivity analysis on the variation of edges capacities. Computational experiments were conducted with the proposed algorithm, whose results were compared with the ones of Gusfield, for randomly generated and well-known instances of the literature. The numerical results demonstrate the potential of the method for some classes of instances. Moreover, the proposed method was adapted for the single maximum flow problem, but failed to improve existing running times for the very same classes of instances.Sociedade Brasileira de Pesquisa Operacional2017-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300437Pesquisa Operacional v.37 n.3 2017reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2017.037.03.0437info:eu-repo/semantics/openAccessAraujo,João Paulo de FreitasRaupp,Fernanda Maria PereiraLeal,José EugenioDiallo,Madiagneeng2018-03-01T00:00:00Zoai:scielo:S0101-74382017000300437Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2018-03-01T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
COMPUTING MAX FLOWS THROUGH CUT NODES |
title |
COMPUTING MAX FLOWS THROUGH CUT NODES |
spellingShingle |
COMPUTING MAX FLOWS THROUGH CUT NODES Araujo,João Paulo de Freitas maximum flow cut-tree cut nodes |
title_short |
COMPUTING MAX FLOWS THROUGH CUT NODES |
title_full |
COMPUTING MAX FLOWS THROUGH CUT NODES |
title_fullStr |
COMPUTING MAX FLOWS THROUGH CUT NODES |
title_full_unstemmed |
COMPUTING MAX FLOWS THROUGH CUT NODES |
title_sort |
COMPUTING MAX FLOWS THROUGH CUT NODES |
author |
Araujo,João Paulo de Freitas |
author_facet |
Araujo,João Paulo de Freitas Raupp,Fernanda Maria Pereira Leal,José Eugenio Diallo,Madiagne |
author_role |
author |
author2 |
Raupp,Fernanda Maria Pereira Leal,José Eugenio Diallo,Madiagne |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Araujo,João Paulo de Freitas Raupp,Fernanda Maria Pereira Leal,José Eugenio Diallo,Madiagne |
dc.subject.por.fl_str_mv |
maximum flow cut-tree cut nodes |
topic |
maximum flow cut-tree cut nodes |
description |
ABSTRACT In this work, the presence of cut nodes in a network is exploited to propose a competitive method for the multi-terminal maximum flow problem. The main idea of the method is based on the relation between cut-trees and cut nodes, which is observed in the context of sensitivity analysis on the variation of edges capacities. Computational experiments were conducted with the proposed algorithm, whose results were compared with the ones of Gusfield, for randomly generated and well-known instances of the literature. The numerical results demonstrate the potential of the method for some classes of instances. Moreover, the proposed method was adapted for the single maximum flow problem, but failed to improve existing running times for the very same classes of instances. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-09-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300437 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300437 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2017.037.03.0437 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.37 n.3 2017 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318018167046144 |