MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS
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-74382017000300571 |
Resumo: | ABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and explore the case of capacity expansion of communications networks. |
id |
SOBRAPO-1_d9509a18441217295d2882a7094dc21f |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382017000300571 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTSnetwork designcapacity and flow assignment problemcapacity expansionABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and explore the case of capacity expansion of communications networks.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-74382017000300571Pesquisa Operacional v.37 n.3 2017reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2017.037.03.0571info:eu-repo/semantics/openAccessMahey,PhilippeSouza,Mauricio C. deeng2018-03-01T00:00:00Zoai:scielo:S0101-74382017000300571Revistahttp://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 |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
title |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
spellingShingle |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS Mahey,Philippe network design capacity and flow assignment problem capacity expansion |
title_short |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
title_full |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
title_fullStr |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
title_full_unstemmed |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
title_sort |
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS |
author |
Mahey,Philippe |
author_facet |
Mahey,Philippe Souza,Mauricio C. de |
author_role |
author |
author2 |
Souza,Mauricio C. de |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Mahey,Philippe Souza,Mauricio C. de |
dc.subject.por.fl_str_mv |
network design capacity and flow assignment problem capacity expansion |
topic |
network design capacity and flow assignment problem capacity expansion |
description |
ABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and explore the case of capacity expansion of communications networks. |
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-74382017000300571 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300571 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2017.037.03.0571 |
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_ |
1750318018175434752 |