Grotschel, Martin; Wakabayashi, Yoshiko 
Assuntos: PROGRAMAÇÃO LINEAR, COMBINATÓRIA, PROGRAMAÇÃO ESTOCÁSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, Martin e WAKABAYASHI, Yoshiko. On the complexity of the monotone asymmetric travelling salesman polytipe II: hypotraceable facets. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/b6b1ddfc-7897-44c2-be66-d21bd3f231fb/316647.pdf. Acesso em: 08 nov. 2025. , 1979APA
Grotschel, M., & Wakabayashi, Y. (1979). On the complexity of the monotone asymmetric travelling salesman polytipe II: hypotraceable facets. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/b6b1ddfc-7897-44c2-be66-d21bd3f231fb/316647.pdfNLM
Grotschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytipe II: hypotraceable facets [Internet]. 1979 ;[citado 2025 nov. 08 ] Available from: https://repositorio.usp.br/directbitstream/b6b1ddfc-7897-44c2-be66-d21bd3f231fb/316647.pdfVancouver
Grotschel M, Wakabayashi Y. On the complexity of the monotone asymmetric travelling salesman polytipe II: hypotraceable facets [Internet]. 1979 ;[citado 2025 nov. 08 ] Available from: https://repositorio.usp.br/directbitstream/b6b1ddfc-7897-44c2-be66-d21bd3f231fb/316647.pdf
