ReP USP - Resultado da busca

Artigo de periodico
Approximating a class of combinatorial problems with rational objective function (2010)
Correa, J. R.; Fernandes, Cristina Gomes ; 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
CORREA, J. R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, v. 124, n. 1-2, p. 255-269, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-010-0364-8. Acesso em: 17 out. 2024.
APA
Correa, J. R., Fernandes, C. G., & Wakabayashi, Y. (2010). Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, 124( 1-2), 255-269. doi:10.1007/s10107-010-0364-8
NLM
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Vancouver
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Artigo de periodico
Approximation algorithms and hardness results for the clique packing problem (2009)
Chataigner, Frederic; Manic, Gerhard; Wakabayashi, Yoshiko ; Yuster, R
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, v. 157, n. 7, p. 1396-1406, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2008.10.017. Acesso em: 17 out. 2024.
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Artigo de periodico
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009)
Fernandes, Cristina Gomes ; Lee, Orlando; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LEE, Orlando e WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, n. 2, p. 272-279, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2007.10.032. Acesso em: 17 out. 2024.
APA
Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032
NLM
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Vancouver
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Artigo de periodico
Exact penalties for variational inequalities with applications to nonlinear complementarity problems (2009)
André, Thiago Afonso de; Silva, Paulo J. S.
Source: Computational Optimization and Applications. Unidade: IME
Subjects: DUALIDADE EM VARIEDADES, FUNÇÕES GENERALIZADAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDRÉ, Thiago Afonso de e SILVA, Paulo J. S. Exact penalties for variational inequalities with applications to nonlinear complementarity problems. Computational Optimization and Applications, v. 47, n. 3, p. 401-429, 2009Tradução . . Disponível em: https://doi.org/10.1007/s10589-008-9232-3. Acesso em: 17 out. 2024.
APA
André, T. A. de, & Silva, P. J. S. (2009). Exact penalties for variational inequalities with applications to nonlinear complementarity problems. Computational Optimization and Applications, 47( 3), 401-429. doi:10.1007/s10589-008-9232-3
NLM
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementarity problems [Internet]. Computational Optimization and Applications. 2009 ; 47( 3): 401-429.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
Vancouver
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementarity problems [Internet]. Computational Optimization and Applications. 2009 ; 47( 3): 401-429.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
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
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008)
Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: European Journal of Operational Research. Unidades: IME, EACH
Subjects: PROGRAMAÇÃO DINÂMICA, ALGORITMOS, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira et al. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, v. 191, n. 1, p. 61-85, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.08.007. Acesso em: 17 out. 2024.
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191( 1), 61-85. doi:10.1016/j.ejor.2007.08.007
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Trabalho de evento-anais periodico
Packing triangles in low degree graphs and indifference graphs (2008)
Manic, Gordana; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Conference titles: European Conference on Combinatorics - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MANIC, Gordana e WAKABAYASHI, Yoshiko. Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.disc.2007.07.100. Acesso em: 17 out. 2024. , 2008
APA
Manic, G., & Wakabayashi, Y. (2008). Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.disc.2007.07.100
NLM
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Vancouver
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
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
Artigo de periodico
Rescaled proximal methods for linearly constrained convex problems (2007)
Silva, Paulo J. S. ; Humes Júnior, Carlos
Source: Rairo - Operations Research. Unidade: IME
Subjects: PROGRAMAÇÃO CONVEXA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo J. S. e HUMES JÚNIOR, Carlos. Rescaled proximal methods for linearly constrained convex problems. Rairo - Operations Research, v. 41, n. 4, p. 367-380, 2007Tradução . . Disponível em: https://doi.org/10.1051/ro:2007032. Acesso em: 17 out. 2024.
APA
Silva, P. J. S., & Humes Júnior, C. (2007). Rescaled proximal methods for linearly constrained convex problems. Rairo - Operations Research, 41( 4), 367-380. doi:10.1051/ro:2007032
NLM
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. Rairo - Operations Research. 2007 ; 41( 4): 367-380.[citado 2024 out. 17 ] Available from: https://doi.org/10.1051/ro:2007032
Vancouver
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. Rairo - Operations Research. 2007 ; 41( 4): 367-380.[citado 2024 out. 17 ] Available from: https://doi.org/10.1051/ro:2007032
Artigo de periodico
A note on an L-approach for solving the manufacturer's pallet loading problem (2005)
Birgin, Ernesto Julian Goldberg ; Morábito Neto, Reinaldo; Nishihara, Fábio Henrique
Source: Journal of the Operational Research Society. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MORÁBITO NETO, Reinaldo e NISHIHARA, Fábio Henrique. A note on an L-approach for solving the manufacturer's pallet loading problem. Journal of the Operational Research Society, v. 56, n. 12, p. 1448-1451, 2005Tradução . . Disponível em: https://doi.org/10.1057/palgrave.jors.2601960. Acesso em: 17 out. 2024.
APA
Birgin, E. J. G., Morábito Neto, R., & Nishihara, F. H. (2005). A note on an L-approach for solving the manufacturer's pallet loading problem. Journal of the Operational Research Society, 56( 12), 1448-1451. doi:10.1057/palgrave.jors.2601960
NLM
Birgin EJG, Morábito Neto R, Nishihara FH. A note on an L-approach for solving the manufacturer's pallet loading problem [Internet]. Journal of the Operational Research Society. 2005 ; 56( 12): 1448-1451.[citado 2024 out. 17 ] Available from: https://doi.org/10.1057/palgrave.jors.2601960
Vancouver
Birgin EJG, Morábito Neto R, Nishihara FH. A note on an L-approach for solving the manufacturer's pallet loading problem [Internet]. Journal of the Operational Research Society. 2005 ; 56( 12): 1448-1451.[citado 2024 out. 17 ] Available from: https://doi.org/10.1057/palgrave.jors.2601960
Artigo de periodico
A sparse dynamic programming algorithm for alignment with non-overlapping inversions (2005)
Lago, Alair Pereira do; Muchnik, I.; Kulikowski, C.
Source: Rairo - Theoretical Informatics and Applications, Paris. Unidade: IME
Assunto: SISTEMAS DE INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LAGO, Alair Pereira do e MUCHNIK, I. e KULIKOWSKI, C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, v. 39, n. 1, p. 175-189, 2005Tradução . . Disponível em: https://doi.org/10.1051/ita:2005011. Acesso em: 17 out. 2024.
APA
Lago, A. P. do, Muchnik, I., & Kulikowski, C. (2005). A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, 39( 1), 175-189. doi:10.1051/ita:2005011
NLM
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.[citado 2024 out. 17 ] Available from: https://doi.org/10.1051/ita:2005011
Vancouver
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.[citado 2024 out. 17 ] Available from: https://doi.org/10.1051/ita:2005011
Trabalho de evento-anais periodico
Approximation results on balanced connected partitions of graphs (2004)
Salgado, Liliane Rose Benning; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Conference on Combinatorics,Graphs and Applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SALGADO, Liliane Rose Benning e WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of graphs. 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/j.endm.2004.06.033. Acesso em: 17 out. 2024. , 2004
APA
Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2004.06.033
NLM
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Vancouver
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Parte de monografia/livro
Pattern inference under many guises (2003)
Sagot, Marie France; Wakabayashi, Yoshiko
Source: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAGOT, Marie France e WAKABAYASHI, Yoshiko. Pattern inference under many guises. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi.org/10.1007/0-387-22444-0_8. Acesso em: 17 out. 2024.
APA
Sagot, M. F., & Wakabayashi, Y. (2003). Pattern inference under many guises. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_8
NLM
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 out. 17 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Vancouver
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 out. 17 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Artigo de periodico
Inexact spectral projected gradient methods on convex sets (2003)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Raydan, Marcos
Source: IMA Journal of Numerical Analysis. Unidade: IME
Assunto: ANÁLISE NUMÉRICA
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 RAYDAN, Marcos. Inexact spectral projected gradient methods on convex sets. IMA Journal of Numerical Analysis, v. 23, n. 4, p. 539-559, 2003Tradução . . Disponível em: https://doi.org/10.1093/imanum/23.4.539. Acesso em: 17 out. 2024.
APA
Birgin, E. J. G., Martínez, J. M., & Raydan, M. (2003). Inexact spectral projected gradient methods on convex sets. IMA Journal of Numerical Analysis, 23( 4), 539-559. doi:10.1093/imanum/23.4.539
NLM
Birgin EJG, Martínez JM, Raydan M. Inexact spectral projected gradient methods on convex sets [Internet]. IMA Journal of Numerical Analysis. 2003 ; 23( 4): 539-559.[citado 2024 out. 17 ] Available from: https://doi.org/10.1093/imanum/23.4.539
Vancouver
Birgin EJG, Martínez JM, Raydan M. Inexact spectral projected gradient methods on convex sets [Internet]. IMA Journal of Numerical Analysis. 2003 ; 23( 4): 539-559.[citado 2024 out. 17 ] Available from: https://doi.org/10.1093/imanum/23.4.539
Artigo de periodico
Estimation of optical parameters of very thin films (2003)
Birgin, Ernesto Julian Goldberg ; Chambouleyron, Ivan Emílio; Martínez, José Mário ; Ventura, S. D.
Source: Applied Numerical Mathematics. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Estimation of optical parameters of very thin films. Applied Numerical Mathematics, v. 47, n. 2, p. 109-119, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0168-9274(03)00055-2. Acesso em: 17 out. 2024.
APA
Birgin, E. J. G., Chambouleyron, I. E., Martínez, J. M., & Ventura, S. D. (2003). Estimation of optical parameters of very thin films. Applied Numerical Mathematics, 47( 2), 109-119. doi:10.1016/s0168-9274(03)00055-2
NLM
Birgin EJG, Chambouleyron IE, Martínez JM, Ventura SD. Estimation of optical parameters of very thin films [Internet]. Applied Numerical Mathematics. 2003 ; 47( 2): 109-119.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0168-9274(03)00055-2
Vancouver
Birgin EJG, Chambouleyron IE, Martínez JM, Ventura SD. Estimation of optical parameters of very thin films [Internet]. Applied Numerical Mathematics. 2003 ; 47( 2): 109-119.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0168-9274(03)00055-2
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Assunto: 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 A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 17 out. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Artigo de periodico
Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate (2003)
Birgin, Ernesto Julian Goldberg ; Chambouleyron, Ivan Emílio; Martínez, José Mário
Source: Journal of Computational and Applied Mathematics. Unidade: IME
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e CHAMBOULEYRON, Ivan Emílio e MARTÍNEZ, José Mário. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. Journal of Computational and Applied Mathematics, v. 152, n. 1/2, p. 35-50, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-0427(02)00695-7. Acesso em: 17 out. 2024.
APA
Birgin, E. J. G., Chambouleyron, I. E., & Martínez, J. M. (2003). Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. Journal of Computational and Applied Mathematics, 152( 1/2), 35-50. doi:10.1016/s0377-0427(02)00695-7
NLM
Birgin EJG, Chambouleyron IE, Martínez JM. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate [Internet]. Journal of Computational and Applied Mathematics. 2003 ; 152( 1/2): 35-50.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-0427(02)00695-7
Vancouver
Birgin EJG, Chambouleyron IE, Martínez JM. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate [Internet]. Journal of Computational and Applied Mathematics. 2003 ; 152( 1/2): 35-50.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-0427(02)00695-7
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
Artigo de periodico
Parametric on-line algorithms for packing rectangles and boxes (2003)
Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: European Journal of Operational Research. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, v. 150, n. 2, p. 281-292, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00539-8. Acesso em: 17 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2003). Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, 150( 2), 281-292. doi:10.1016/s0377-2217(02)00539-8
NLM
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
Vancouver
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration