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: 16 out. 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 out. 16 ] 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 out. 16 ] 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: 16 out. 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 out. 16 ] 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 out. 16 ] 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: 16 out. 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 out. 16 ] 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 out. 16 ] 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: 16 out. 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 out. 16 ] 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 out. 16 ] 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: 16 out. 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 out. 16 ] 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 out. 16 ] 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: 16 out. 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 out. 16 ] 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 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/951a477a-c1d3-4ce2-85a8-8bbca8788a2a/775445.pdf
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
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: 16 out. 2024.
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 2024 out. 16 ] 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 2024 out. 16 ] Available from: https://doi.org/10.1007/BFb0120923
Artigo de periodico
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (1981)
Grotschel, Martin; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO LINEAR, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, Martin e WAKABAYASHI, Yoshiko. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics, v. 34, n. 1, p. 43-59, 1981Tradução . . Disponível em: https://doi.org/10.1016/0012-365X(81)90021-2. Acesso em: 16 out. 2024.
APA
Grotschel, M., & Wakabayashi, Y. (1981). On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics, 34( 1), 43-59. doi:10.1016/0012-365X(81)90021-2
NLM
Grotschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. Discrete Mathematics. 1981 ; 34( 1): 43-59.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/0012-365X(81)90021-2
Vancouver
Grotschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. Discrete Mathematics. 1981 ; 34( 1): 43-59.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/0012-365X(81)90021-2
Artigo de periodico
Hypotraceable digraphs (1980)
Grötschel, Martin ; Thomassen, Carsten ; Wakabayashi, Yoshiko
Source: Journal of 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
GRÖTSCHEL, Martin e THOMASSEN, Carsten e WAKABAYASHI, Yoshiko. Hypotraceable digraphs. Journal of Graph Theory, v. 4, n. 4, p. 377-381, 1980Tradução . . Disponível em: https://doi.org/10.1002/jgt.3190040406. Acesso em: 16 out. 2024.
APA
Grötschel, M., Thomassen, C., & Wakabayashi, Y. (1980). Hypotraceable digraphs. Journal of Graph Theory, 4( 4), 377-381. doi:10.1002/jgt.3190040406
NLM
Grötschel M, Thomassen C, Wakabayashi Y. Hypotraceable digraphs [Internet]. Journal of Graph Theory. 1980 ; 4( 4): 377-381.[citado 2024 out. 16 ] Available from: https://doi.org/10.1002/jgt.3190040406
Vancouver
Grötschel M, Thomassen C, Wakabayashi Y. Hypotraceable digraphs [Internet]. Journal of Graph Theory. 1980 ; 4( 4): 377-381.[citado 2024 out. 16 ] Available from: https://doi.org/10.1002/jgt.3190040406
Relatorio tecnico
Hypotraceable diagraphs II (1979)
Grotschel, Martin; Thomassen, Carsten; Wakabayashi, Yoshiko
Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, Martin e THOMASSEN, Carsten e WAKABAYASHI, Yoshiko. Hypotraceable diagraphs II. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/38f3f2f3-7f22-4b62-9ecc-ada5919b6d39/316649.pdf. Acesso em: 16 out. 2024. , 1979
APA
Grotschel, M., Thomassen, C., & Wakabayashi, Y. (1979). Hypotraceable diagraphs II. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/38f3f2f3-7f22-4b62-9ecc-ada5919b6d39/316649.pdf
NLM
Grotschel M, Thomassen C, Wakabayashi Y. Hypotraceable diagraphs II [Internet]. 1979 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/38f3f2f3-7f22-4b62-9ecc-ada5919b6d39/316649.pdf
Vancouver
Grotschel M, Thomassen C, Wakabayashi Y. Hypotraceable diagraphs II [Internet]. 1979 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/38f3f2f3-7f22-4b62-9ecc-ada5919b6d39/316649.pdf
Relatorio tecnico
On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (1978)
Grötschel, Martin ; Wakabayashi, Yoshiko
Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
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 complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf. Acesso em: 16 out. 2024. , 1978
APA
Grötschel, M., & Wakabayashi, Y. (1978). On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf
NLM
Grötschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. 1978 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf
Vancouver
Grötschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. 1978 ;[citado 2024 out. 16 ] Available from: https://repositorio.usp.br/directbitstream/f1f748a0-4c1d-4d6b-bbc2-9607127d307b/316591.pdf

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Non normalized affiliation