ReP USP - Resultado da busca

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: 17 out. 2024.
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 2024 out. 17 ] 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 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Artigo de periodico
A note on the approximability of cutting stock problems (2007)
Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: European Journal of Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira et al. A note on the approximability of cutting stock problems. European Journal of Operational Research, v. 183, n. 3, p. 1328-1332, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2005.09.053. Acesso em: 17 out. 2024.
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2007). A note on the approximability of cutting stock problems. European Journal of Operational Research, 183( 3), 1328-1332. doi:10.1016/j.ejor.2005.09.053
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
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: 17 out. 2024.
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 2024 out. 17 ] 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 2024 out. 17 ] 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: 17 out. 2024.
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 2024 out. 17 ] 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 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Artigo de periodico
Minimization subproblems and heuristics for an applied clustering problem (2003)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Ronconi, Débora Pretti
Source: European Journal of Operational Research. Unidades: IME, EP
Subjects: PROGRAMAÇÃO NÃO LINEAR, HEURÍSTICA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário e RONCONI, Débora Pretti. Minimization subproblems and heuristics for an applied clustering problem. European Journal of Operational Research, v. 146, n. 1, p. 19-34, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00208-4. Acesso em: 17 out. 2024.
APA
Birgin, E. J. G., Martínez, J. M., & Ronconi, D. P. (2003). Minimization subproblems and heuristics for an applied clustering problem. European Journal of Operational Research, 146( 1), 19-34. doi:10.1016/s0377-2217(02)00208-4
NLM
Birgin EJG, Martínez JM, Ronconi DP. Minimization subproblems and heuristics for an applied clustering problem [Internet]. European Journal of Operational Research. 2003 ; 146( 1): 19-34.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-2217(02)00208-4
Vancouver
Birgin EJG, Martínez JM, Ronconi DP. Minimization subproblems and heuristics for an applied clustering problem [Internet]. European Journal of Operational Research. 2003 ; 146( 1): 19-34.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-2217(02)00208-4
Trabalho de evento-anais periodico
Multidimensional cube packing (2001)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Raghavan, Prabhakar; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00237-9. Acesso em: 17 out. 2024. , 2001
APA
Kohayakawa, Y., Miyazawa, F. K., Raghavan, P., & Wakabayashi, Y. (2001). Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00237-9
NLM
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Vancouver
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Trabalho de evento-anais periodico
Multicuts in unweighted digraphs with bounded degree and bounded tree-width (2001)
Calinescu, Gruia ; Fernandes, Cristina Gomes
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes. Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00258-6. Acesso em: 17 out. 2024. , 2001
APA
Calinescu, G., & Fernandes, C. G. (2001). Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00258-6
NLM
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Vancouver
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Trabalho de evento
The UPS problem (2001)
Fernandes, Cristina Gomes ; Nierho, Till
Source: Proceedings. Conference titles: Annual Symposium on Theoretical Aspects of Computer Science - STACS. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e NIERHO, Till. The UPS problem. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44693-1_21. Acesso em: 17 out. 2024.
APA
Fernandes, C. G., & Nierho, T. (2001). The UPS problem. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44693-1_21
NLM
Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Vancouver
Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Trabalho de evento
Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Reed, Bruce
Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 17 out. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11
NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Funding Agencies

Non normalized affiliation