Filtros : "Moura, Phablo Fernando Soares" Limpar

Filtros



Refine with date range


  • Source: European Journal of Operational Research. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Disponível em 2023-01-05Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko; OTA, Matheus Jun. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, Amsterdam, 2021. Disponível em: < https://doi.org/10.1016/j.ejor.2020.12.059 > DOI: 10.1016/j.ejor.2020.12.059.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Wakabayashi, Y., & Ota, M. J. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research. doi:10.1016/j.ejor.2020.12.059
    • NLM

      Miyazawa FK, Moura PFS, Wakabayashi Y, Ota MJ. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
    • Vancouver

      Miyazawa FK, Moura PFS, Wakabayashi Y, Ota MJ. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
  • Source: Proceedings. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Assunto: PROGRAMAÇÃO LINEAR

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi; MOURA, Phablo Fernando Soares; OTA, Matheus J; WAKABAYASHI, Yoshiko. Cut and flow formulations for the balanced connected k-partition problem. Anais.. Cham: Springer, 2020.Disponível em: DOI: 10.1007/978-3-030-53262-8_11.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2020). Cut and flow formulations for the balanced connected k-partition problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-53262-8_11
    • NLM

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;Available from: https://doi.org/10.1007/978-3-030-53262-8_11
    • Vancouver

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;Available from: https://doi.org/10.1007/978-3-030-53262-8_11
  • Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics[S.l: s.n.], 2020.Disponível em: DOI: 10.1016/j.dam.2019.08.002.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics[S.l: s.n.], 2017.Disponível em: DOI: 10.1016/j.endm.2017.10.017.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam. doi:10.1016/j.endm.2017.10.017
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.Available from: https://dx.doi.org/10.1016/j.endm.2017.10.017
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.Available from: https://dx.doi.org/10.1016/j.endm.2017.10.017
  • Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Graph colorings and digraph subdivisions. 2017.Universidade de São Paulo, São Paulo, 2017. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/ >.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Graph colorings and digraph subdivisions. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
    • NLM

      Moura PFS, Wakabayashi Y. Graph colorings and digraph subdivisions [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
    • Vancouver

      Moura PFS, Wakabayashi Y. Graph colorings and digraph subdivisions [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
  • Source: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COELHO, Rafael S; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, Dordrecht, v. 34, n. 4, p. 1060–1083, 2017. Disponível em: < http://dx.doi.org/10.1007/s10878-017-0128-y > DOI: 10.1007/s10878-017-0128-y.
    • APA

      Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2017). The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, 34( 4), 1060–1083. doi:10.1007/s10878-017-0128-y
    • NLM

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.Available from: http://dx.doi.org/10.1007/s10878-017-0128-y
    • Vancouver

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.Available from: http://dx.doi.org/10.1007/s10878-017-0128-y
  • Source: Mathematical Programming. Unidades: EACH, IME

    Subjects: ALGORITMOS, POLIEDROS, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CAMPÊLO, Manoel; FREIRE, Alexandre S; LIMA, Karla Roberta Pereira Sampaio; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, Heidelberg, v. 156, n. 1, p. 303-330, 2016. Disponível em: < http://dx.doi.org/10.1007/s10107-015-0880-7 > DOI: 10.1007/s10107-015-0880-7.
    • APA

      Campêlo, M., Freire, A. S., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2016). The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, 156( 1), 303-330. doi:10.1007/s10107-015-0880-7
    • NLM

      Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.Available from: http://dx.doi.org/10.1007/s10107-015-0880-7
    • Vancouver

      Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.Available from: http://dx.doi.org/10.1007/s10107-015-0880-7
  • Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, ALGORITMOS

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; COELHO, Rafael Santos; WAKABAYASHI, Yoshiko. Polyhedral and computational results on the k-hop connected dominating set problem. Anais.. Philadelphia: Mathematical Optimization Society, 2015.Disponível em: .
    • APA

      Moura, P. F. S., Coelho, R. S., & Wakabayashi, Y. (2015). Polyhedral and computational results on the k-hop connected dominating set problem. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
    • NLM

      Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
    • Vancouver

      Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COELHO, Rafael S; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: hardness and polyhedra. Electronic Notes in Discrete Mathematics[S.l: s.n.], 2015.Disponível em: DOI: 10.1016/j.endm.2015.07.011.
    • APA

      Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2015). The k-hop connected dominating set problem: hardness and polyhedra. Electronic Notes in Discrete Mathematics. Amsterdam. doi:10.1016/j.endm.2015.07.011
    • NLM

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.Available from: http://dx.doi.org/10.1016/j.endm.2015.07.011
    • Vancouver

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.Available from: http://dx.doi.org/10.1016/j.endm.2015.07.011
  • Source: Electronic Notes in Discrete Mathematics. Unidades: EACH, IME

    Subjects: ALGORITMOS, POLIEDROS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CAMPÊLO, Manoel; LIMA, Karla Roberta Pereira Sampaio; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics, Amsterdam, v. no 2013, p. 233\2013238, 2013. Disponível em: < http://dx.doi.org/10.1016/j.endm.2013.10.036 > DOI: 10.1016/j.endm.2013.10.036.
    • APA

      Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics, no 2013, 233\2013238. doi:10.1016/j.endm.2013.10.036
    • NLM

      Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233\2013238.Available from: http://dx.doi.org/10.1016/j.endm.2013.10.036
    • Vancouver

      Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233\2013238.Available from: http://dx.doi.org/10.1016/j.endm.2013.10.036
  • Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Recoloração convexa de grafos algoritmos e poliedros. 2013.Universidade de São Paulo, São Paulo, 2013. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19112013-193725 >.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2013). Recoloração convexa de grafos algoritmos e poliedros. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19112013-193725
    • NLM

      Moura PFS, Wakabayashi Y. Recoloração convexa de grafos algoritmos e poliedros [Internet]. 2013 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19112013-193725
    • Vancouver

      Moura PFS, Wakabayashi Y. Recoloração convexa de grafos algoritmos e poliedros [Internet]. 2013 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19112013-193725

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2021