Menu

Filtros : "facets" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento-anais periodico

    The k-hop connected dominating set problem: hardness and polyhedra (2015)

    Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko

    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 e MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: hardness and polyhedra. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.011. Acesso em: 22 jan. 2026. , 2015

    • 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: Instituto de Matemática e Estatística, Universidade de São Paulo. 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.[citado 2026 jan. 22 ] Available from: https://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.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011

  • Trabalho de evento

    On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets (1981)

    Grötschel , Martin; Wakabayashi, Yoshiko

    Source: Mathematical programming at Oberwolfach. Conference titles: Mathematische Optimierung. Unidade: IME

    Subjects: PROGRAMAÇÃO LINEAR, TEORIA DOS GRAFOS

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

    • ABNT

      GRÖTSCHEL , Martin e WAKABAYASHI, Yoshiko. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets. 1981, Anais.. Berlin: Springer, 1981. Disponível em: https://doi.org/10.1007/BFb0120923. Acesso em: 22 jan. 2026.

    • APA

      Grötschel , M., & Wakabayashi, Y. (1981). On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets. In Mathematical programming at Oberwolfach. Berlin: Springer. doi:10.1007/BFb0120923

    • NLM

      Grötschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets [Internet]. Mathematical programming at Oberwolfach. 1981 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/BFb0120923

    • Vancouver

      Grötschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets [Internet]. Mathematical programming at Oberwolfach. 1981 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/BFb0120923
  • 1

1 - 2 (2 records)

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