ReP USP - Resultado da busca

Artigo de periodico
Techniques and results on approximation algorithms for packing circles (2022)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: São Paulo Journal of Mathematical Sciences. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, v. 16, n. 1, p. 585-615, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00301-3. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2022). Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, 16( 1), 585-615. doi:10.1007/s40863-022-00301-3
NLM
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Vancouver
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Artigo de periodico
A tight lower bound for the online bounded space hypercube bin packing problem (2021)
Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Discrete Mathematics & Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, v. 23, n. 3, p. 1-13, 2021Tradução . . Disponível em: https://doi.org/10.46298/dmtcs.8325. Acesso em: 27 nov. 2025.
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2021). A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, 23( 3), 1-13. doi:10.46298/dmtcs.8325
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2025 nov. 27 ] Available from: https://doi.org/10.46298/dmtcs.8325
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2025 nov. 27 ] Available from: https://doi.org/10.46298/dmtcs.8325
Artigo de periodico
Three-dimensional packings with rotations (2009)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Computers & Operations Research. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Three-dimensional packings with rotations. Computers & Operations Research, v. 36, n. 10, p. 2801-2815, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2008.12.015. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2009). Three-dimensional packings with rotations. Computers & Operations Research, 36( 10), 2801-2815. doi:10.1016/j.cor.2008.12.015
NLM
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Vancouver
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Artigo de periodico
Two- and three-dimensional parametric packing (2007)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Computers & Operations Research. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Two- and three-dimensional parametric packing. Computers & Operations Research, v. 34, n. 9, p. 2589-2603, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2005.10.001. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers & Operations Research, 34( 9), 2589-2603. doi:10.1016/j.cor.2005.10.001
NLM
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Vancouver
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Trabalho de evento
Packing problems with orthogonal rotations (2004)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Packing problems with orthogonal rotations. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_40. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_40
NLM
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Vancouver
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Artigo de periodico
An algorithmforthe three-dimensional packing problem with asymptotic performance analysis (1997)
Miyazawa, Flavio Keidi; Wakabayashi, Yoshiko
Source: Algorithmica. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. An algorithmforthe three-dimensional packing problem with asymptotic performance analysis. Algorithmica, v. 18, n. 1, p. 122-144, 1997Tradução . . Disponível em: https://doi.org/10.1007/BF02523692. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (1997). An algorithmforthe three-dimensional packing problem with asymptotic performance analysis. Algorithmica, 18( 1), 122-144. doi:10.1007/BF02523692
NLM
Miyazawa FK, Wakabayashi Y. An algorithmforthe three-dimensional packing problem with asymptotic performance analysis [Internet]. Algorithmica. 1997 ; 18( 1): 122-144.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/BF02523692
Vancouver
Miyazawa FK, Wakabayashi Y. An algorithmforthe three-dimensional packing problem with asymptotic performance analysis [Internet]. Algorithmica. 1997 ; 18( 1): 122-144.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/BF02523692

USP Schools

ReP

Filtros

Date published