Menu

Filtros : "Financiamento PRONEX" "IME" "IME" Removidos: "Carnegie Mellon University (CMU)" "GARCIA, MANUEL VALENTIM DE PERA" "Colóquio Brasileiro de Matemática" Limpar

Filtros

Refine with date range

1 - 20 (52 records)

  • Artigo de periodico

    Critical principal singularities of hypersurfaces in Euclidean 4-spaces (2022)

    Garcia, Ronaldo ; Lopes, Débora ; Sotomayor, Jorge

    Source: Journal of Singularities. Unidade: IME

    Subjects: GEOMETRIA DIFERENCIAL, FOLHEAÇÕES, EQUAÇÕES DIFERENCIAIS ORDINÁRIAS, ANÁLISE GLOBAL

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      GARCIA, Ronaldo e LOPES, Débora e SOTOMAYOR, Jorge. Critical principal singularities of hypersurfaces in Euclidean 4-spaces. Journal of Singularities, v. 25, p. 150-172, 2022Tradução . . Disponível em: https://doi.org/10.5427/jsing.2022.25i. Acesso em: 14 nov. 2024.

    • APA

      Garcia, R., Lopes, D., & Sotomayor, J. (2022). Critical principal singularities of hypersurfaces in Euclidean 4-spaces. Journal of Singularities, 25, 150-172. doi:10.5427/jsing.2022.25i

    • NLM

      Garcia R, Lopes D, Sotomayor J. Critical principal singularities of hypersurfaces in Euclidean 4-spaces [Internet]. Journal of Singularities. 2022 ; 25 150-172.[citado 2024 nov. 14 ] Available from: https://doi.org/10.5427/jsing.2022.25i

    • Vancouver

      Garcia R, Lopes D, Sotomayor J. Critical principal singularities of hypersurfaces in Euclidean 4-spaces [Internet]. Journal of Singularities. 2022 ; 25 150-172.[citado 2024 nov. 14 ] Available from: https://doi.org/10.5427/jsing.2022.25i

  • Artigo de periodico

    Instability theory of kink and anti-kink profiles for the sine-Gordon equation on Josephson tricrystal boundaries (2021)

    Pava, Jaime Angulo ; Plaza, Ramón G

    Source: Physica D: Nonlinear Phenomena. Unidade: IME

    Subjects: SOLITONS, EQUAÇÕES DIFERENCIAIS PARCIAIS ELÍTICAS, OPERADORES DIFERENCIAIS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      PAVA, Jaime Angulo e PLAZA, Ramón G. Instability theory of kink and anti-kink profiles for the sine-Gordon equation on Josephson tricrystal boundaries. Physica D: Nonlinear Phenomena, v. 427, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.physd.2021.133020. Acesso em: 14 nov. 2024.

    • APA

      Pava, J. A., & Plaza, R. G. (2021). Instability theory of kink and anti-kink profiles for the sine-Gordon equation on Josephson tricrystal boundaries. Physica D: Nonlinear Phenomena, 427. doi:10.1016/j.physd.2021.133020

    • NLM

      Pava JA, Plaza RG. Instability theory of kink and anti-kink profiles for the sine-Gordon equation on Josephson tricrystal boundaries [Internet]. Physica D: Nonlinear Phenomena. 2021 ; 427[citado 2024 nov. 14 ] Available from: https://doi.org/10.1016/j.physd.2021.133020

    • Vancouver

      Pava JA, Plaza RG. Instability theory of kink and anti-kink profiles for the sine-Gordon equation on Josephson tricrystal boundaries [Internet]. Physica D: Nonlinear Phenomena. 2021 ; 427[citado 2024 nov. 14 ] Available from: https://doi.org/10.1016/j.physd.2021.133020

  • Artigo de periodico

    Instability of cnoidal-peak for the NLS-δ-equation (2012)

    Pava, Jaime Angulo

    Source: Mathematische Nachrichten. Unidade: IME

    Assunto: EQUAÇÕES DIFERENCIAIS PARCIAIS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      PAVA, Jaime Angulo. Instability of cnoidal-peak for the NLS-δ-equation. Mathematische Nachrichten, v. 285, p. 1572-1602, 2012Tradução . . Disponível em: https://doi.org/10.1002/mana.201100209. Acesso em: 14 nov. 2024.

    • APA

      Pava, J. A. (2012). Instability of cnoidal-peak for the NLS-δ-equation. Mathematische Nachrichten, 285, 1572-1602. doi:10.1002/mana.201100209

    • NLM

      Pava JA. Instability of cnoidal-peak for the NLS-δ-equation [Internet]. Mathematische Nachrichten. 2012 ; 285 1572-1602.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1002/mana.201100209

    • Vancouver

      Pava JA. Instability of cnoidal-peak for the NLS-δ-equation [Internet]. Mathematische Nachrichten. 2012 ; 285 1572-1602.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1002/mana.201100209

  • 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015

  • Trabalho de evento

    A polyhedral investigation of the LCS problem and a repetition-free variant (2008)

    Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      FERNANDES, Cristina Gomes et al. A polyhedral investigation of the LCS problem and a repetition-free variant. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-78773-0_29. Acesso em: 14 nov. 2024.

    • APA

      Fernandes, C. G., Ferreira, C. E., Tjandraatmadja, C., & Wakabayashi, Y. (2008). A polyhedral investigation of the LCS problem and a repetition-free variant. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-78773-0_29

    • NLM

      Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 nov. 14 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29

    • Vancouver

      Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 nov. 14 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29

  • 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100

  • Parte de monografia/livro

    Stochastic chains with memory in variable length (2008)

    Galves, Antonio ; Löcherbach, Eva

    Source: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Unidade: IME

    Assunto: CADEIAS DE MARKOV

    How to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      GALVES, Antonio e LÖCHERBACH, Eva. Stochastic chains with memory in variable length. Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tradução . Tampere: Tampere International Center for Signal Processing, 2008. . . Acesso em: 14 nov. 2024.

    • APA

      Galves, A., & Löcherbach, E. (2008). Stochastic chains with memory in variable length. In Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing.

    • NLM

      Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 nov. 14 ]

    • Vancouver

      Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 nov. 14 ]

  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] Available from: https://doi.org/10.1051/ro:2007032

  • Trabalho de evento-anais periodico

    Lines of principal curvature near singular end points of surfaces in R³ (2006)

    Sotomayor, Jorge ; Garcia, Ronaldo

    Source: Advanced Studies in Pure Mathematics. Conference titles: MSJ International Research Institute Singularity Theory and Its Applications. Unidade: IME

    Subjects: SUPERFÍCIES, GEOMETRIA DIFERENCIAL, TEORIA DAS SINGULARIDADES

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      SOTOMAYOR, Jorge e GARCIA, Ronaldo. Lines of principal curvature near singular end points of surfaces in R³. Advanced Studies in Pure Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.2969/aspm/04310437. Acesso em: 14 nov. 2024. , 2006

    • APA

      Sotomayor, J., & Garcia, R. (2006). Lines of principal curvature near singular end points of surfaces in R³. Advanced Studies in Pure Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.2969/aspm/04310437

    • NLM

      Sotomayor J, Garcia R. Lines of principal curvature near singular end points of surfaces in R³ [Internet]. Advanced Studies in Pure Mathematics. 2006 ; 43 437-462.[citado 2024 nov. 14 ] Available from: https://doi.org/10.2969/aspm/04310437

    • Vancouver

      Sotomayor J, Garcia R. Lines of principal curvature near singular end points of surfaces in R³ [Internet]. Advanced Studies in Pure Mathematics. 2006 ; 43 437-462.[citado 2024 nov. 14 ] Available from: https://doi.org/10.2969/aspm/04310437

  • Artigo de periodico

    Geometry of contours and Peierls estimates in d=1 Ising models with long range interactions (2005)

    Cassandro, Marzio; Ferrari, Pablo Augusto ; Merola, lmmacolata; Presutti, Errico

    Source: Journal of Mathematical Physics. Unidade: IME

    Assunto: PERCOLAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      CASSANDRO, Marzio et al. Geometry of contours and Peierls estimates in d=1 Ising models with long range interactions. Journal of Mathematical Physics, v. 46, n. 5, 2005Tradução . . Disponível em: https://doi.org/10.1063/1.1897644. Acesso em: 14 nov. 2024.

    • APA

      Cassandro, M., Ferrari, P. A., Merola, lmmacolata, & Presutti, E. (2005). Geometry of contours and Peierls estimates in d=1 Ising models with long range interactions. Journal of Mathematical Physics, 46( 5). doi:10.1063/1.1897644

    • NLM

      Cassandro M, Ferrari PA, Merola lmmacolata, Presutti E. Geometry of contours and Peierls estimates in d=1 Ising models with long range interactions [Internet]. Journal of Mathematical Physics. 2005 ; 46( 5):[citado 2024 nov. 14 ] Available from: https://doi.org/10.1063/1.1897644

    • Vancouver

      Cassandro M, Ferrari PA, Merola lmmacolata, Presutti E. Geometry of contours and Peierls estimates in d=1 Ising models with long range interactions [Internet]. Journal of Mathematical Physics. 2005 ; 46( 5):[citado 2024 nov. 14 ] Available from: https://doi.org/10.1063/1.1897644

  • 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

    Acesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] 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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] Available from: https://doi.org/10.1051/ita:2005011

  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 14 nov. 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 nov. 14 ] 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 nov. 14 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40

1 - 20 (52 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024