Filtros : "OTIMIZAÇÃO COMBINATÓRIA" "Reino Unido" Removidos: "Espanha" "Armentano, Vinícius Amaral" "LOPES, GESIEL RIOS" "Mestrado Profissionalizante" Limpar

Filtros



Refine with date range


  • Source: International Journal of Electrical Power & Energy Systems. Unidades: ICMC, EESC

    Subjects: SISTEMAS ELÉTRICOS DE POTÊNCIA, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, OBSERVABILIDADE, ALGORITMOS GENÉTICOS

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

      VIGLIASSI, Marcos Paulo et al. Multi-objective evolutionary algorithm in tables for placement of SCADA and PMU considering the concept of Pareto Frontier. International Journal of Electrical Power & Energy Systems, v. 106, p. 373-382, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijepes.2018.10.026. Acesso em: 15 out. 2024.
    • APA

      Vigliassi, M. P., Massignan, J. A. D., Delbem, A. C. B., & London Junior, J. B. A. (2019). Multi-objective evolutionary algorithm in tables for placement of SCADA and PMU considering the concept of Pareto Frontier. International Journal of Electrical Power & Energy Systems, 106, 373-382. doi:10.1016/j.ijepes.2018.10.026
    • NLM

      Vigliassi MP, Massignan JAD, Delbem ACB, London Junior JBA. Multi-objective evolutionary algorithm in tables for placement of SCADA and PMU considering the concept of Pareto Frontier [Internet]. International Journal of Electrical Power & Energy Systems. 2019 ; 106 373-382.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.ijepes.2018.10.026
    • Vancouver

      Vigliassi MP, Massignan JAD, Delbem ACB, London Junior JBA. Multi-objective evolutionary algorithm in tables for placement of SCADA and PMU considering the concept of Pareto Frontier [Internet]. International Journal of Electrical Power & Energy Systems. 2019 ; 106 373-382.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.ijepes.2018.10.026
  • Source: Journal of Synchrotron Radiation. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, OTIMIZAÇÃO COMBINATÓRIA, MÉTODOS ITERATIVOS

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

      LIMA, Camila de e HELOU, Elias Salomão. Fast projection/backprojection and incremental methods applied to synchrotron light tomographic reconstruction. Journal of Synchrotron Radiation, v. 25, p. 248-256, 2018Tradução . . Disponível em: https://doi.org/10.1107/S1600577517015715. Acesso em: 15 out. 2024.
    • APA

      Lima, C. de, & Helou, E. S. (2018). Fast projection/backprojection and incremental methods applied to synchrotron light tomographic reconstruction. Journal of Synchrotron Radiation, 25, 248-256. doi:10.1107/S1600577517015715
    • NLM

      Lima C de, Helou ES. Fast projection/backprojection and incremental methods applied to synchrotron light tomographic reconstruction [Internet]. Journal of Synchrotron Radiation. 2018 ; 25 248-256.[citado 2024 out. 15 ] Available from: https://doi.org/10.1107/S1600577517015715
    • Vancouver

      Lima C de, Helou ES. Fast projection/backprojection and incremental methods applied to synchrotron light tomographic reconstruction [Internet]. Journal of Synchrotron Radiation. 2018 ; 25 248-256.[citado 2024 out. 15 ] Available from: https://doi.org/10.1107/S1600577517015715
  • Source: International Journal of Production Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL, GEOMETRIA COMPUTACIONAL, ESTRUTURAS DE DADOS

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

      CHERRI, Luiz Henrique et al. An innovative data structure to handle the geometry of nesting problems. International Journal of Production Research, v. 56, n. 23, p. 7085-7102, 2018Tradução . . Disponível em: https://doi.org/10.1080/00207543.2017.1413256. Acesso em: 15 out. 2024.
    • APA

      Cherri, L. H., Cherri, A. C., Carravilla, M. A., Oliveira, J. F., Toledo, F. M. B. de, & Vianna, A. C. G. (2018). An innovative data structure to handle the geometry of nesting problems. International Journal of Production Research, 56( 23), 7085-7102. doi:10.1080/00207543.2017.1413256
    • NLM

      Cherri LH, Cherri AC, Carravilla MA, Oliveira JF, Toledo FMB de, Vianna ACG. An innovative data structure to handle the geometry of nesting problems [Internet]. International Journal of Production Research. 2018 ; 56( 23): 7085-7102.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2017.1413256
    • Vancouver

      Cherri LH, Cherri AC, Carravilla MA, Oliveira JF, Toledo FMB de, Vianna ACG. An innovative data structure to handle the geometry of nesting problems [Internet]. International Journal of Production Research. 2018 ; 56( 23): 7085-7102.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2017.1413256
  • Source: Journal of Statistical Computation and Simulation. Unidade: ICMC

    Subjects: ESTATÍSTICA, ESTATÍSTICA APLICADA, INFERÊNCIA ESTATÍSTICA, INFERÊNCIA BAYESIANA, PROBABILIDADE, OTIMIZAÇÃO, 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

      CONCEIÇÃO, Katiane Silva et al. Zero-modified power series distribution and its Hurdle distribution version. Journal of Statistical Computation and Simulation, v. Fe 2017, n. 9, p. 1842-1862, 2017Tradução . . Disponível em: https://doi.org/10.1080/00949655.2017.1289529. Acesso em: 15 out. 2024.
    • APA

      Conceição, K. S., Louzada, F., Andrade, M. G. de, & Helou, E. S. (2017). Zero-modified power series distribution and its Hurdle distribution version. Journal of Statistical Computation and Simulation, Fe 2017( 9), 1842-1862. doi:10.1080/00949655.2017.1289529
    • NLM

      Conceição KS, Louzada F, Andrade MG de, Helou ES. Zero-modified power series distribution and its Hurdle distribution version [Internet]. Journal of Statistical Computation and Simulation. 2017 ; Fe 2017( 9): 1842-1862.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00949655.2017.1289529
    • Vancouver

      Conceição KS, Louzada F, Andrade MG de, Helou ES. Zero-modified power series distribution and its Hurdle distribution version [Internet]. Journal of Statistical Computation and Simulation. 2017 ; Fe 2017( 9): 1842-1862.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00949655.2017.1289529
  • Source: Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, OTIMIZAÇÃO COMBINATÓRIA, OTIMIZAÇÃO CONVEXA

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

      HELOU, Elias Salomão e ZIBETTI, M. V. W e MIQUELES, E. X. Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, v. 33, n. 4, p. 044010-1-044010-26, 2017Tradução . . Disponível em: https://doi.org/10.1088/1361-6420/33/4/044010. Acesso em: 15 out. 2024.
    • APA

      Helou, E. S., Zibetti, M. V. W., & Miqueles, E. X. (2017). Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, 33( 4), 044010-1-044010-26. doi:10.1088/1361-6420/33/4/044010
    • NLM

      Helou ES, Zibetti MVW, Miqueles EX. Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2017 ; 33( 4): 044010-1-044010-26.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1361-6420/33/4/044010
    • Vancouver

      Helou ES, Zibetti MVW, Miqueles EX. Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2017 ; 33( 4): 044010-1-044010-26.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1361-6420/33/4/044010
  • Source: Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, 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

      HELOU, Elias Salomão e SIMÕES, Lucas E. A. 'épsilon'-subgradient algorithms for bilevel convex optimization. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, v. 33, n. 5, p. 055020-1-055020-33, 2017Tradução . . Disponível em: https://doi.org/10.1088/1361-6420/aa6136. Acesso em: 15 out. 2024.
    • APA

      Helou, E. S., & Simões, L. E. A. (2017). 'épsilon'-subgradient algorithms for bilevel convex optimization. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, 33( 5), 055020-1-055020-33. doi:10.1088/1361-6420/aa6136
    • NLM

      Helou ES, Simões LEA. 'épsilon'-subgradient algorithms for bilevel convex optimization [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2017 ; 33( 5): 055020-1-055020-33.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1361-6420/aa6136
    • Vancouver

      Helou ES, Simões LEA. 'épsilon'-subgradient algorithms for bilevel convex optimization [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2017 ; 33( 5): 055020-1-055020-33.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1361-6420/aa6136
  • Source: Computers and Operations Research. Unidade: ICMC

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      RODRIGUES, Marcos Okamura e TOLEDO, Franklina Maria Bragion de. A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, v. No 2017, p. 221-234, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.11.006. Acesso em: 15 out. 2024.
    • APA

      Rodrigues, M. O., & Toledo, F. M. B. de. (2017). A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, No 2017, 221-234. doi:10.1016/j.cor.2016.11.006
    • NLM

      Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
    • Vancouver

      Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
  • Source: The International Journal of Advanced Manufacturing Technology. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      MACEDO, Pedro Belluco et al. Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs. The International Journal of Advanced Manufacturing Technology, v. Fe 2016, n. 5, p. 1241-1257, 2016Tradução . . Disponível em: https://doi.org/10.1007/s00170-015-7445-z. Acesso em: 15 out. 2024.
    • APA

      Macedo, P. B., Alem, D., Santos, M. O. dos, Lage Junior, M., & Moreno, A. (2016). Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs. The International Journal of Advanced Manufacturing Technology, Fe 2016( 5), 1241-1257. doi:10.1007/s00170-015-7445-z
    • NLM

      Macedo PB, Alem D, Santos MO dos, Lage Junior M, Moreno A. Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs [Internet]. The International Journal of Advanced Manufacturing Technology. 2016 ; Fe 2016( 5): 1241-1257.[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/s00170-015-7445-z
    • Vancouver

      Macedo PB, Alem D, Santos MO dos, Lage Junior M, Moreno A. Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs [Internet]. The International Journal of Advanced Manufacturing Technology. 2016 ; Fe 2016( 5): 1241-1257.[citado 2024 out. 15 ] Available from: https://doi.org/10.1007/s00170-015-7445-z
  • Source: International Journal of Production Research. Unidade: ICMC

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      LEÃO, Aline A. S et al. A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research, n. 3, p. 712-721, 2016Tradução . . Disponível em: https://doi.org/10.1080/00207543.2015.1041571. Acesso em: 15 out. 2024.
    • APA

      Leão, A. A. S., Toledo, F. M. B. de, Oliveira, J. F., & Carravilla, M. A. (2016). A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research, ( 3), 712-721. doi:10.1080/00207543.2015.1041571
    • NLM

      Leão AAS, Toledo FMB de, Oliveira JF, Carravilla MA. A semi-continuous MIP model for the irregular strip packing problem [Internet]. International Journal of Production Research. 2016 ;( 3): 712-721.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2015.1041571
    • Vancouver

      Leão AAS, Toledo FMB de, Oliveira JF, Carravilla MA. A semi-continuous MIP model for the irregular strip packing problem [Internet]. International Journal of Production Research. 2016 ;( 3): 712-721.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2015.1041571
  • Source: Optimization Methods and Software. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, 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

      HELOU, Elias Salomão e SANTOS, Sandra A e SIMÕES, Lucas E. A. On the differentiability check in gradient sampling methods. Optimization Methods and Software, v. 31, n. 5, p. 983-1007, 2016Tradução . . Disponível em: https://doi.org/10.1080/10556788.2016.1178262. Acesso em: 15 out. 2024.
    • APA

      Helou, E. S., Santos, S. A., & Simões, L. E. A. (2016). On the differentiability check in gradient sampling methods. Optimization Methods and Software, 31( 5), 983-1007. doi:10.1080/10556788.2016.1178262
    • NLM

      Helou ES, Santos SA, Simões LEA. On the differentiability check in gradient sampling methods [Internet]. Optimization Methods and Software. 2016 ; 31( 5): 983-1007.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/10556788.2016.1178262
    • Vancouver

      Helou ES, Santos SA, Simões LEA. On the differentiability check in gradient sampling methods [Internet]. Optimization Methods and Software. 2016 ; 31( 5): 983-1007.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/10556788.2016.1178262
  • Source: Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, OTIMIZAÇÃO COMBINATÓRIA, PROCESSOS ESTOCÁSTICOS

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

      OLIVEIRA, Rafael Massambone de e HELOU, Elias Salomão e COSTA, Eduardo Fontoura. String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, v. 32, n. 11, p. 115014-1-115014-29, 2016Tradução . . Disponível em: https://doi.org/10.1088/0266-5611/32/11/115014. Acesso em: 15 out. 2024.
    • APA

      Oliveira, R. M. de, Helou, E. S., & Costa, E. F. (2016). String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, 32( 11), 115014-1-115014-29. doi:10.1088/0266-5611/32/11/115014
    • NLM

      Oliveira RM de, Helou ES, Costa EF. String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2016 ; 32( 11): 115014-1-115014-29.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/0266-5611/32/11/115014
    • Vancouver

      Oliveira RM de, Helou ES, Costa EF. String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2016 ; 32( 11): 115014-1-115014-29.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/0266-5611/32/11/115014
  • Source: Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, 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

      HELOU, Elias Salomão et al. String-averaging expectation-maximization for maximum likelihood estimation in emission tomography. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, v. 30, n. 5, p. 055003-1-055003-20, 2014Tradução . . Disponível em: https://doi.org/10.1088/0266-5611/30/5/055003. Acesso em: 15 out. 2024.
    • APA

      Helou, E. S., Censor, Y., Chen, T. -B., Chern, I. -L., Pierro, Á. R. D., Jiang, M., & Shing Lu, H. H. (2014). String-averaging expectation-maximization for maximum likelihood estimation in emission tomography. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data, 30( 5), 055003-1-055003-20. doi:10.1088/0266-5611/30/5/055003
    • NLM

      Helou ES, Censor Y, Chen T-B, Chern I-L, Pierro ÁRD, Jiang M, Shing Lu HH. String-averaging expectation-maximization for maximum likelihood estimation in emission tomography [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2014 ; 30( 5): 055003-1-055003-20.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/0266-5611/30/5/055003
    • Vancouver

      Helou ES, Censor Y, Chen T-B, Chern I-L, Pierro ÁRD, Jiang M, Shing Lu HH. String-averaging expectation-maximization for maximum likelihood estimation in emission tomography [Internet]. Inverse Problems : An International Journal of Inverse Problems, Inverse Methods and Computerised Inversion of Data. 2014 ; 30( 5): 055003-1-055003-20.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/0266-5611/30/5/055003
  • Source: Journal of Physics : Conference Series. Conference titles: International Conference on Mathematical Modelling in Physical Sciences - IC-MSQUARE. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, 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

      MIQUELES, Eduardo X e HELOU, Elias Salomão e PIERRO, Álvaro Rodolfo De. Generalized backprojection operator: fast calculation. Journal of Physics : Conference Series. Bristol, United Kingdom: IOP Publishing. Disponível em: https://doi.org/10.1088/1742-6596/490/1/012148. Acesso em: 15 out. 2024. , 2014
    • APA

      Miqueles, E. X., Helou, E. S., & Pierro, Á. R. D. (2014). Generalized backprojection operator: fast calculation. Journal of Physics : Conference Series. Bristol, United Kingdom: IOP Publishing. doi:10.1088/1742-6596/490/1/012148
    • NLM

      Miqueles EX, Helou ES, Pierro ÁRD. Generalized backprojection operator: fast calculation [Internet]. Journal of Physics : Conference Series. 2014 ; 490 012148-1-012148-5.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1742-6596/490/1/012148
    • Vancouver

      Miqueles EX, Helou ES, Pierro ÁRD. Generalized backprojection operator: fast calculation [Internet]. Journal of Physics : Conference Series. 2014 ; 490 012148-1-012148-5.[citado 2024 out. 15 ] Available from: https://doi.org/10.1088/1742-6596/490/1/012148
  • Source: Journal of the Operational Research Society. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      BELO FILHO, Márcio Antônio Ferreira e TOLEDO, Franklina Maria Bragion de e ALMADA-LOBO, Bernardo. Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover. Journal of the Operational Research Society, v. 65, n. 11, p. 1735-1747, 2014Tradução . . Disponível em: https://doi.org/10.1057/jors.2013.131. Acesso em: 15 out. 2024.
    • APA

      Belo Filho, M. A. F., Toledo, F. M. B. de, & Almada-Lobo, B. (2014). Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover. Journal of the Operational Research Society, 65( 11), 1735-1747. doi:10.1057/jors.2013.131
    • NLM

      Belo Filho MAF, Toledo FMB de, Almada-Lobo B. Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover [Internet]. Journal of the Operational Research Society. 2014 ; 65( 11): 1735-1747.[citado 2024 out. 15 ] Available from: https://doi.org/10.1057/jors.2013.131
    • Vancouver

      Belo Filho MAF, Toledo FMB de, Almada-Lobo B. Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover [Internet]. Journal of the Operational Research Society. 2014 ; 65( 11): 1735-1747.[citado 2024 out. 15 ] Available from: https://doi.org/10.1057/jors.2013.131
  • Source: International Journal of Production Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      BELO FILHO, Márcio Antônio Ferreira e SANTOS, Maristela Oliveira dos e MENESES, Claudio Nogueira de. Asynchronous teams for joint lot-sizing and scheduling problem in flow shops. International Journal of Production Research, v. 50, n. 20, p. 5809-5822, 2012Tradução . . Disponível em: https://doi.org/10.1080/00207543.2011.628955. Acesso em: 15 out. 2024.
    • APA

      Belo Filho, M. A. F., Santos, M. O. dos, & Meneses, C. N. de. (2012). Asynchronous teams for joint lot-sizing and scheduling problem in flow shops. International Journal of Production Research, 50( 20), 5809-5822. doi:10.1080/00207543.2011.628955
    • NLM

      Belo Filho MAF, Santos MO dos, Meneses CN de. Asynchronous teams for joint lot-sizing and scheduling problem in flow shops [Internet]. International Journal of Production Research. 2012 ; 50( 20): 5809-5822.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2011.628955
    • Vancouver

      Belo Filho MAF, Santos MO dos, Meneses CN de. Asynchronous teams for joint lot-sizing and scheduling problem in flow shops [Internet]. International Journal of Production Research. 2012 ; 50( 20): 5809-5822.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/00207543.2011.628955
  • Source: Optimization. Unidade: ICMC

    Subjects: OTIMIZAÇÃO, 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

      HELOU, Elias Salomão e PIERRO, Álvaro Rodolfo de. On perturbed steepest descent methods with inexact line search for bilevel convex optimization. Optimization, v. 60, n. 8\20139, p. 991\20131008, 2011Tradução . . Disponível em: https://doi.org/10.1080/02331934.2010.536231. Acesso em: 15 out. 2024.
    • APA

      Helou, E. S., & Pierro, Á. R. de. (2011). On perturbed steepest descent methods with inexact line search for bilevel convex optimization. Optimization, 60( 8\20139), 991\20131008. doi:10.1080/02331934.2010.536231
    • NLM

      Helou ES, Pierro ÁR de. On perturbed steepest descent methods with inexact line search for bilevel convex optimization [Internet]. Optimization. 2011 ; 60( 8\20139): 991\20131008.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/02331934.2010.536231
    • Vancouver

      Helou ES, Pierro ÁR de. On perturbed steepest descent methods with inexact line search for bilevel convex optimization [Internet]. Optimization. 2011 ; 60( 8\20139): 991\20131008.[citado 2024 out. 15 ] Available from: https://doi.org/10.1080/02331934.2010.536231
  • Source: Pattern Recognition. Unidade: FFCLRP

    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

      RIS, Marcelo e BARRERA, Júnior e MARTINS JUNIOR, David C. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, v. 43, n. 3, p. 557-568, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2009.08.018. Acesso em: 15 out. 2024.
    • APA

      Ris, M., Barrera, J., & Martins Junior, D. C. (2010). U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, 43( 3), 557-568. doi:10.1016/j.patcog.2009.08.018
    • NLM

      Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
    • Vancouver

      Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2024 out. 15 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
  • Source: Combinatorics, Probability & Computing. 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

      LEE, Orlando e WAKABAYASHI, Yoshiko. On the circuit cover problem for mixed graphs. Combinatorics, Probability & Computing, v. 11, n. 1, p. 43-59, 2002Tradução . . Disponível em: https://doi.org/10.1017/S0963548301004989. Acesso em: 15 out. 2024.
    • APA

      Lee, O., & Wakabayashi, Y. (2002). On the circuit cover problem for mixed graphs. Combinatorics, Probability & Computing, 11( 1), 43-59. doi:10.1017/S0963548301004989
    • NLM

      Lee O, Wakabayashi Y. On the circuit cover problem for mixed graphs [Internet]. Combinatorics, Probability & Computing. 2002 ; 11( 1): 43-59.[citado 2024 out. 15 ] Available from: https://doi.org/10.1017/S0963548301004989
    • Vancouver

      Lee O, Wakabayashi Y. On the circuit cover problem for mixed graphs [Internet]. Combinatorics, Probability & Computing. 2002 ; 11( 1): 43-59.[citado 2024 out. 15 ] Available from: https://doi.org/10.1017/S0963548301004989

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