The Balanced Connected k-Partition Problem: Polyhedra and Algorithms

Detalhes bibliográficos
Autor(a) principal: MATHEUS JUN OTA
Data de Publicação: 2020
Tipo de documento: Dissertação
Título da fonte: Portal de Dados Abertos da CAPES
Texto Completo: https://sucupira.capes.gov.br/sucupira/public/consultas/coleta/trabalhoConclusao/viewTrabalhoConclusao.jsf?popup=true&id_trabalho=9799998
id BRCRIS_ebfff9f6d090a21f25908b13a7e67a08
network_acronym_str CAPES
network_name_str Portal de Dados Abertos da CAPES
dc.title.pt-BR.fl_str_mv The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
title The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
spellingShingle The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
facetas
facets
MATHEUS JUN OTA
title_short The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
title_full The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
title_fullStr The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
title_full_unstemmed The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
title_sort The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
topic facetas
facets
publishDate 2020
format masterThesis
url https://sucupira.capes.gov.br/sucupira/public/consultas/coleta/trabalhoConclusao/viewTrabalhoConclusao.jsf?popup=true&id_trabalho=9799998
author_role author
author MATHEUS JUN OTA
author_facet MATHEUS JUN OTA
dc.contributor.authorLattes.fl_str_mv http://lattes.cnpq.br/7738972154001613
dc.contributor.advisor1.fl_str_mv FLAVIO KEIDI MIYAZAWA
Phablo Fernando Soares Moura
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/1410613909006372
http://lattes.cnpq.br/8436515676441851
dc.contributor.advisor1orcid.por.fl_str_mv https://orcid.org/0000000281760874
https://orcid.org/0000-0002-1067-6421
dc.publisher.none.fl_str_mv UNIVERSIDADE ESTADUAL DE CAMPINAS
publisher.none.fl_str_mv UNIVERSIDADE ESTADUAL DE CAMPINAS
instname_str UNIVERSIDADE ESTADUAL DE CAMPINAS
dc.publisher.program.fl_str_mv CIÊNCIA DA COMPUTAÇÃO
dc.description.course.none.fl_txt_mv CIÊNCIA DA COMPUTAÇÃO
reponame_str Portal de Dados Abertos da CAPES
collection Portal de Dados Abertos da CAPES
spelling CAPESPortal de Dados Abertos da CAPESThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and AlgorithmsThe Balanced Connected k-Partition Problem: Polyhedra and Algorithmsfacetas2020masterThesishttps://sucupira.capes.gov.br/sucupira/public/consultas/coleta/trabalhoConclusao/viewTrabalhoConclusao.jsf?popup=true&id_trabalho=9799998authorMATHEUS JUN OTAhttp://lattes.cnpq.br/7738972154001613FLAVIO KEIDI MIYAZAWAhttp://lattes.cnpq.br/1410613909006372https://orcid.org/0000000281760874UNIVERSIDADE ESTADUAL DE CAMPINASUNIVERSIDADE ESTADUAL DE CAMPINASUNIVERSIDADE ESTADUAL DE CAMPINASCIÊNCIA DA COMPUTAÇÃOCIÊNCIA DA COMPUTAÇÃOPortal de Dados Abertos da CAPESPortal de Dados Abertos da CAPES
identifier_str_mv OTA, MATHEUS JUN. The Balanced Connected k-Partition Problem: Polyhedra and Algorithms. 2020. Tese.
dc.identifier.citation.fl_str_mv OTA, MATHEUS JUN. The Balanced Connected k-Partition Problem: Polyhedra and Algorithms. 2020. Tese.
_version_ 1741885670991855616