ReP USP - Resultado da busca

Artigo de periodico
Facets of the clique partitioning polytope (1990)
Grotschel, M; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Facets of the clique partitioning polytope. Mathematical Programming, v. 47, n. 3 , p. 367-387, 1990Tradução . . Disponível em: https://doi.org/10.1007/BF01580870. Acesso em: 12 jun. 2024.
APA
Grotschel, M., & Wakabayashi, Y. (1990). Facets of the clique partitioning polytope. Mathematical Programming, 47( 3 ), 367-387. doi:10.1007/BF01580870
NLM
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/BF01580870
Vancouver
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/BF01580870
Parte de monografia/livro
Composition of facets of the clique partitioning polytope (1990)
Grotschel, M; Wakabayashi, Yoshiko
Source: Topics in combinatorics graph theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Composition of facets of the clique partitioning polytope. Topics in combinatorics graph theory. Tradução . Heidelberg: Physica-Verlag, 1990. . Disponível em: https://doi.org/10.1007/978-3-642-46908-4_31. Acesso em: 12 jun. 2024.
APA
Grotschel, M., & Wakabayashi, Y. (1990). Composition of facets of the clique partitioning polytope. In Topics in combinatorics graph theory. Heidelberg: Physica-Verlag. doi:10.1007/978-3-642-46908-4_31
NLM
Grotschel M, Wakabayashi Y. Composition of facets of the clique partitioning polytope [Internet]. In: Topics in combinatorics graph theory. Heidelberg: Physica-Verlag; 1990. [citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/978-3-642-46908-4_31
Vancouver
Grotschel M, Wakabayashi Y. Composition of facets of the clique partitioning polytope [Internet]. In: Topics in combinatorics graph theory. Heidelberg: Physica-Verlag; 1990. [citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/978-3-642-46908-4_31
Artigo de periodico
A cutting plane algorithm for a clustering problem (1989)
Grotschel, M; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. A cutting plane algorithm for a clustering problem. Mathematical Programming, v. 45, n. 1 , p. 59-96, 1989Tradução . . Disponível em: https://doi.org/10.1007/BF01589097. Acesso em: 12 jun. 2024.
APA
Grotschel, M., & Wakabayashi, Y. (1989). A cutting plane algorithm for a clustering problem. Mathematical Programming, 45( 1 ), 59-96. doi:10.1007/BF01589097
NLM
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/BF01589097
Vancouver
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/BF01589097
Relatorio tecnico
Facets of the clique partitioning polytope (1988)
Grotschel, M; Wakabayashi, Yoshiko
Unidade: IME
Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Facets of the clique partitioning polytope. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf. Acesso em: 12 jun. 2024. , 1988
APA
Grotschel, M., & Wakabayashi, Y. (1988). Facets of the clique partitioning polytope. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf
NLM
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf
Vancouver
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf
Relatorio tecnico
Composition of facets of the clique partitioning polytope (1988)
Grotschel, M; Wakabayashi, Yoshiko
Unidade: IME
Subjects: GEOMETRIA CONVEXA, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Composition of facets of the clique partitioning polytope. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/73302cf6-c755-441e-8b90-49a2b8ebb8e0/775443.pdf. Acesso em: 12 jun. 2024. , 1988
APA
Grotschel, M., & Wakabayashi, Y. (1988). Composition of facets of the clique partitioning polytope. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/73302cf6-c755-441e-8b90-49a2b8ebb8e0/775443.pdf
NLM
Grotschel M, Wakabayashi Y. Composition of facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/73302cf6-c755-441e-8b90-49a2b8ebb8e0/775443.pdf
Vancouver
Grotschel M, Wakabayashi Y. Composition of facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/73302cf6-c755-441e-8b90-49a2b8ebb8e0/775443.pdf
Relatorio tecnico
A cutting plane algorithm for a clustering problem (1988)
Grotschel, M; Wakabayashi, Yoshiko
Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. A cutting plane algorithm for a clustering problem. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/951a477a-c1d3-4ce2-85a8-8bbca8788a2a/775445.pdf. Acesso em: 12 jun. 2024. , 1988
APA
Grotschel, M., & Wakabayashi, Y. (1988). A cutting plane algorithm for a clustering problem. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/951a477a-c1d3-4ce2-85a8-8bbca8788a2a/775445.pdf
NLM
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/951a477a-c1d3-4ce2-85a8-8bbca8788a2a/775445.pdf
Vancouver
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. 1988 ;[citado 2024 jun. 12 ] Available from: https://repositorio.usp.br/directbitstream/951a477a-c1d3-4ce2-85a8-8bbca8788a2a/775445.pdf

USP Schools

ReP

Filtros