Horacio Hideki Yanasse
Orcid: 0000-0002-6946-9670
According to our database1,
Horacio Hideki Yanasse
authored at least 39 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
J. Comb. Optim., August, 2024
2023
Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern.
J. Oper. Res. Soc., May, 2023
Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks.
Int. J. Prod. Res., May, 2023
2022
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost.
J. Comb. Optim., 2022
Int. Trans. Oper. Res., 2022
A support tool for planning classrooms considering social distancing between students.
Comput. Appl. Math., 2022
2021
Int. J. Prod. Res., 2021
Using Machine Learning to support health system planning during the Covid-19 pandemic: a case study using data from São José dos Campos (Brazil).
CLEI Electron. J., 2021
2019
Expert Syst. Appl., 2019
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics.
Comput. Appl. Math., 2019
2018
Proceedings of the Handbook of Heuristics., 2018
2017
Eur. J. Oper. Res., 2017
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories.
Ann. Oper. Res., 2017
2016
Scientometrics, 2016
2014
Benford's Law and articles of scientific journals: comparison of JCR® and Scopus data.
Scientometrics, 2014
Eur. J. Oper. Res., 2014
Comput. Ind. Eng., 2014
2013
The usable leftover one-dimensional cutting stock problem - a priority-in-use heuristic.
Int. Trans. Oper. Res., 2013
2011
Proceedings of the SPLASH'11 Workshops, 2011
2010
Parallel Comput., 2010
The minimization of open stacks problem: A review of some properties and their use in pre-processing operations.
Eur. J. Oper. Res., 2010
2009
The one-dimensional cutting stock problem with usable leftover - A heuristic approach.
Eur. J. Oper. Res., 2009
2008
Theor. Comput. Sci., 2008
Comput. Oper. Res., 2008
2007
2006
A hybrid heuristic to reduce the number of different patterns in cutting stock problems.
Comput. Oper. Res., 2006
2005
Estudo e Implementacao de Algoritmos de Roteamento sobre Grafos em um Sistema de Informacoes Geograficas
CoRR, 2005
2004
A method for solving the minimization of the maximum number of open stacks problem within a cutting process.
Comput. Oper. Res., 2004
2002
Comput. Oper. Res., 2002
1999
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999
1997
Eur. J. Oper. Res., 1997
1995
Discret. Appl. Math., 1995
1987
1984