Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2003 |
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-74382003000100012 |
Resumo: | We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems. |
id |
SOBRAPO-1_f478374c76b105b158434b5dd89187f3 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382003000100012 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problemsmodeling combinatorial optimization problemsoptimization in graphscharacterization of connected subgraphsWe present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Sociedade Brasileira de Pesquisa Operacional2003-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100012Pesquisa Operacional v.23 n.1 2003reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382003000100012info:eu-repo/semantics/openAccessMaculan,NelsonPlateau,GérardLisser,Abdeleng2003-05-26T00:00:00Zoai:scielo:S0101-74382003000100012Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2003-05-26T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
title |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
spellingShingle |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems Maculan,Nelson modeling combinatorial optimization problems optimization in graphs characterization of connected subgraphs |
title_short |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
title_full |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
title_fullStr |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
title_full_unstemmed |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
title_sort |
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems |
author |
Maculan,Nelson |
author_facet |
Maculan,Nelson Plateau,Gérard Lisser,Abdel |
author_role |
author |
author2 |
Plateau,Gérard Lisser,Abdel |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Maculan,Nelson Plateau,Gérard Lisser,Abdel |
dc.subject.por.fl_str_mv |
modeling combinatorial optimization problems optimization in graphs characterization of connected subgraphs |
topic |
modeling combinatorial optimization problems optimization in graphs characterization of connected subgraphs |
description |
We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems. |
publishDate |
2003 |
dc.date.none.fl_str_mv |
2003-01-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-74382003000100012 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100012 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0101-74382003000100012 |
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.23 n.1 2003 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_ |
1750318016241860608 |