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: 29 set. 2024.APA
Grotschel, M., & Wakabayashi, Y. (1989). A cutting plane algorithm for a clustering problem. Mathematical Programming, 45( 1 ), 59-96. doi:10.1007/BF01589097NLM
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2024 set. 29 ] Available from: https://doi.org/10.1007/BF01589097Vancouver
Grotschel M, Wakabayashi Y. A cutting plane algorithm for a clustering problem [Internet]. Mathematical Programming. 1989 ; 45( 1 ): 59-96.[citado 2024 set. 29 ] Available from: https://doi.org/10.1007/BF01589097
