ReP USP - Resultado da busca

Artigo de periodico
On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem” (2024)
Bueno, L. F; Haeser, Gabriel ; Kolossoski, Oliver
Source: European Journal of Operational Research. 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
BUENO, L. F e HAESER, Gabriel e KOLOSSOSKI, Oliver. On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”. European Journal of Operational Research, v. 313, n. 3, p. 1217-1222, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2023.11.001. Acesso em: 31 jul. 2024.
APA
Bueno, L. F., Haeser, G., & Kolossoski, O. (2024). On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”. European Journal of Operational Research, 313( 3), 1217-1222. doi:10.1016/j.ejor.2023.11.001
NLM
Bueno LF, Haeser G, Kolossoski O. On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem” [Internet]. European Journal of Operational Research. 2024 ; 313( 3): 1217-1222.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2023.11.001
Vancouver
Bueno LF, Haeser G, Kolossoski O. On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem” [Internet]. European Journal of Operational Research. 2024 ; 313( 3): 1217-1222.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2023.11.001
Artigo de periodico
Metaheuristics for the online printing shop scheduling problem (2021)
Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Ronconi, Débora Pretti ; Voos, Holger
Source: European Journal of Operational Research. Unidades: IME, EP
Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 31 jul. 2024.
APA
Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021
NLM
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
Vancouver
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
Artigo de periodico
Partitioning a graph into balanced connected classes: Formulations, separation and experiments (2021)
Miyazawa, Flavio Keidi ; Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: European Journal of Operational Research. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi et al. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, v. 293, n. 3, p. 826-836, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.059. Acesso em: 31 jul. 2024.
APA
Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, 293( 3), 826-836. doi:10.1016/j.ejor.2020.12.059
NLM
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
Vancouver
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
Artigo de periodico
A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (2019)
Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano
Source: European Journal of Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.07.006. Acesso em: 31 jul. 2024.
APA
Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
NLM
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Vancouver
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Artigo de periodico
List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (2015)
Birgin, Ernesto Julian Goldberg ; Jesus Filho, José Eurípedes Ferreira de; Ronconi, Débora Pretti
Source: European Journal of Operational Research. Unidades: IME, EP
Subjects: ALGORITMOS DE SCHEDULING, PESQUISA OPERACIONAL, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, v. 247, n. 2, p. 421-440, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2015.06.023. Acesso em: 31 jul. 2024.
APA
Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2015). List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, 247( 2), 421-440. doi:10.1016/j.ejor.2015.06.023
NLM
Birgin EJG, Jesus Filho JEF de, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2015.06.023
Vancouver
Birgin EJG, Jesus Filho JEF de, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2015.06.023
Artigo de periodico
Deterministic and stochastic global optimization techniques for planar covering with ellipses problems (2013)
Andretta, Marina ; Birgin, Ernesto Julian Goldberg
Source: European Journal of Operational Research. Unidades: ICMC, IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDRETTA, Marina e BIRGIN, Ernesto Julian Goldberg. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. European Journal of Operational Research, v. 224, n. 1, p. 23\201340, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2012.07.020. Acesso em: 31 jul. 2024.
APA
Andretta, M., & Birgin, E. J. G. (2013). Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. European Journal of Operational Research, 224( 1), 23\201340. doi:10.1016/j.ejor.2012.07.020
NLM
Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems [Internet]. European Journal of Operational Research. 2013 ; 224( 1): 23\201340.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2012.07.020
Vancouver
Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems [Internet]. European Journal of Operational Research. 2013 ; 224( 1): 23\201340.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2012.07.020
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: 31 jul. 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 jul. 31 ] 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 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Artigo de periodico
Reliability properties under a stopping time shift (2008)
Bueno, Vanderlei da Costa
Source: European Journal of Operational Research. Unidade: IME
Assunto: PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Vanderlei da Costa. Reliability properties under a stopping time shift. European Journal of Operational Research, v. 186, n. 1, p. 202-210, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.02.006. Acesso em: 31 jul. 2024.
APA
Bueno, V. da C. (2008). Reliability properties under a stopping time shift. European Journal of Operational Research, 186( 1), 202-210. doi:10.1016/j.ejor.2007.02.006
NLM
Bueno V da C. Reliability properties under a stopping time shift [Internet]. European Journal of Operational Research. 2008 ; 186( 1): 202-210.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2007.02.006
Vancouver
Bueno V da C. Reliability properties under a stopping time shift [Internet]. European Journal of Operational Research. 2008 ; 186( 1): 202-210.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2007.02.006
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: 31 jul. 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 jul. 31 ] 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 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
Artigo de periodico
Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components (2005)
Bueno, Vanderlei da Costa
Source: European Journal of Operational Research. Unidade: IME
Assunto: PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Vanderlei da Costa. Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components. European Journal of Operational Research, v. 165, n. 3, p. 786-793, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2003.01.004. Acesso em: 31 jul. 2024.
APA
Bueno, V. da C. (2005). Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components. European Journal of Operational Research, 165( 3), 786-793. doi:10.1016/j.ejor.2003.01.004
NLM
Bueno V da C. Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components [Internet]. European Journal of Operational Research. 2005 ; 165( 3): 786-793.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2003.01.004
Vancouver
Bueno V da C. Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components [Internet]. European Journal of Operational Research. 2005 ; 165( 3): 786-793.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2003.01.004
Artigo de periodico
Optimizing the packing of cylinders into a rectangular container: a nonlinear approach (2005)
Birgin, Ernesto Julian Goldberg ; Ronconi, Débora Pretti ; Martinez, Jesus Manuel
Source: European Journal of Operational Research. Unidades: IME, EP
Subjects: OTIMIZAÇÃO MATEMÁTICA, OTIMIZAÇÃO NÃO LINEAR, 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 RONCONI, Débora Pretti e MARTINEZ, Jesus Manuel. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research, v. 160, n. 1, p. 19-33, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2003.06.018. Acesso em: 31 jul. 2024.
APA
Birgin, E. J. G., Ronconi, D. P., & Martinez, J. M. (2005). Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research, 160( 1), 19-33. doi:10.1016/j.ejor.2003.06.018
NLM
Birgin EJG, Ronconi DP, Martinez JM. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach [Internet]. European Journal of Operational Research. 2005 ; 160( 1): 19-33.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2003.06.018
Vancouver
Birgin EJG, Ronconi DP, Martinez JM. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach [Internet]. European Journal of Operational Research. 2005 ; 160( 1): 19-33.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/j.ejor.2003.06.018
Artigo de periodico
A heuristic for the continuous capacity and flow assignment (2003)
Queiroz, Marcelo Gomes de ; Humes Júnior, Carlos
Source: European Journal of Operational Research. Unidade: IME
Assunto: OTIMIZAÇÃO GLOBAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
QUEIROZ, Marcelo Gomes de e HUMES JÚNIOR, Carlos. A heuristic for the continuous capacity and flow assignment. European Journal of Operational Research, v. 146, n. 3, p. 444-459, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00219-9. Acesso em: 31 jul. 2024.
APA
Queiroz, M. G. de, & Humes Júnior, C. (2003). A heuristic for the continuous capacity and flow assignment. European Journal of Operational Research, 146( 3), 444-459. doi:10.1016/s0377-2217(02)00219-9
NLM
Queiroz MG de, Humes Júnior C. A heuristic for the continuous capacity and flow assignment [Internet]. European Journal of Operational Research. 2003 ; 146( 3): 444-459.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/s0377-2217(02)00219-9
Vancouver
Queiroz MG de, Humes Júnior C. A heuristic for the continuous capacity and flow assignment [Internet]. European Journal of Operational Research. 2003 ; 146( 3): 444-459.[citado 2024 jul. 31 ] Available from: https://doi.org/10.1016/s0377-2217(02)00219-9
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: 31 jul. 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 jul. 31 ] 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 jul. 31 ] 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: 31 jul. 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 jul. 31 ] 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 jul. 31 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Funding Agencies

Indexado em

Non normalized affiliation