default search action
Horacio Hideki Yanasse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Mateus Martin
, Horacio Hideki Yanasse, Maristela Oliveira Santos, Reinaldo Morabito:
Models for two-dimensional bin packing problems with customer order spread. J. Comb. Optim. 48(1): 8 (2024) - 2023
- [j35]Mateus Martin
Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. Int. J. Prod. Res. 61(9): 2895-2916 (2023) - [j34]Felipe Kesrouani Lemos
Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern. J. Oper. Res. Soc. 74(5): 1331-1345 (2023) - 2022
- [j33]Juliano Cavalcante Bortolete, Luis Felipe Bueno
A support tool for planning classrooms considering social distancing between students. Comput. Appl. Math. 41(1) (2022) - [j32]Mateus Martin
Mathematical models for the minimization of open stacks problem. Int. Trans. Oper. Res. 29(5): 2944-2967 (2022) - [j31]Mateus Martin
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost. J. Comb. Optim. 44(1): 557-582 (2022) - 2021
- [j30]Leila Abuabara, Maria Gabriela Valeriano, Carlos Roberto Veiga Kiffer, Horacio Hideki Yanasse, Ana Carolina Lorena:
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. 24(3) (2021) - [j29]Tiago Tiburcio da Silva
A new multicommodity flow model for the job sequencing and tool switching problem. Int. J. Prod. Res. 59(12): 3617-3632 (2021)
2010 – 2019
- 2019
- [j28]Tiago Tiburcio da Silva
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics. Comput. Appl. Math. 38(4) (2019) - [j27]Rodolfo Ranck Júnior, Horacio Hideki Yanasse
A hybrid approach for a multi-compartment container loading problem. Expert Syst. Appl. 137: 471-492 (2019) - 2018
- [r1]Mariá C. V. Nascimento, Horacio Hideki Yanasse, Desiree Maldonado Carvalho:
The Multi-plant Lot Sizing Problem with Multiple Periods and Items. Handbook of Heuristics 2018: 1291-1306 - 2017
- [j26]Alyne Toscano
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. Ann. Oper. Res. 258(2): 719-746 (2017) - [j25]Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse
Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257(3): 834-844 (2017) - 2016
- [j24]Alexandre Donizeti Alves
An analysis of bibliometric indicators to JCR according to Benford's law. Scientometrics 107(3): 1489-1499 (2016) - 2014
- [j23]Bruno Jensen Virginio da Silva, Reinaldo Morabito
Production scheduling of assembly fixtures in the aeronautical industry. Comput. Ind. Eng. 67: 195-203 (2014) - [j22]Adriana Cristina Cherri, Marcos Nereu Arenales, Horacio Hideki Yanasse
The one-dimensional cutting stock problem with usable leftovers - A survey. Eur. J. Oper. Res. 236(2): 395-402 (2014) - [j21]Alexandre Donizeti Alves
Benford's Law and articles of scientific journals: comparison of JCR® and Scopus data. Scientometrics 98(1): 173-184 (2014) - 2013
- [j20]Adriana Cristina Cherri, Marcos Nereu Arenales, Horacio Hideki Yanasse
The usable leftover one-dimensional cutting stock problem - a priority-in-use heuristic. Int. Trans. Oper. Res. 20(2): 189-199 (2013) - 2011
- [c1]Alexandre Donizeti Alves
LattesMiner: a multilingual DSL for information extraction from lattes platform. SPLASH Workshops 2011: 85-92 - 2010
- [j19]Alexandre Linhares
Search intensity versus search diversity: a false trade off? Appl. Intell. 32(3): 279-291 (2010) - [j18]Horacio Hideki Yanasse
The minimization of open stacks problem: A review of some properties and their use in pre-processing operations. Eur. J. Oper. Res. 203(3): 559-567 (2010) - [j17]Carlos Alberto Alonso Sanches
Observations on optimal parallelizations of two-list algorithm. Parallel Comput. 36(1): 65-67 (2010)
2000 – 2009
- 2009
- [j16]Adriana Cristina Cherri, Marcos Nereu Arenales, Horacio Hideki Yanasse
The one-dimensional cutting stock problem with usable leftover - A heuristic approach. Eur. J. Oper. Res. 196(3): 897-908 (2009) - [j15]Reinaldo Morabito
Special issue on cutting, packing and related problems. Int. Trans. Oper. Res. 16(6): 659 (2009) - 2008
- [j14]Horacio Hideki Yanasse
An enumeration scheme to generate constrained exact checkerboard patterns. Comput. Oper. Res. 35(6): 2114-2128 (2008) - [j13]Carlos Alberto Alonso Sanches
Parallel time and space upper-bounds for the subset-sum problem. Theor. Comput. Sci. 407(1-3): 342-348 (2008) - 2007
- [j12]Carlos Alberto Alonso Sanches
An optimal and scalable parallelization of the two-list. Eur. J. Oper. Res. 176(2): 870-879 (2007) - [j11]Horacio Hideki Yanasse
An integrated cutting stock and sequencing problem. Eur. J. Oper. Res. 183(3): 1353-1370 (2007) - 2006
- [j10]Horacio Hideki Yanasse
A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Comput. Oper. Res. 33: 2744-2756 (2006) - 2005
- [j9]Horacio Hideki Yanasse
Checkerboard pattern: proposals for its generation. Int. Trans. Oper. Res. 12(1): 21-45 (2005) - [i1]Rudini Menezes Sampaio, Horacio Hideki Yanasse:
Estudo e Implementacao de Algoritmos de Roteamento sobre Grafos em um Sistema de Informacoes Geograficas. CoRR abs/cs/0505031 (2005) - 2004
- [j8]José Carlos Becceneri, Horacio Hideki Yanasse
A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Comput. Oper. Res. 31(14): 2315-2332 (2004) - 2002
- [j7]Alexandre Linhares
Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Comput. Oper. Res. 29(12): 1759-1772 (2002) - [j6]Carlos Alberto Alonso Sanches
Comments on parallel algorithms for the knapsack problem. Parallel Comput. 28(10): 1501-1505 (2002)
1990 – 1999
- 1999
- [j5]Alexandre Linhares
Linear gate assignment: a fast statistical mechanics approach. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(12): 1750-1758 (1999) - 1997
- [j4]Horacio Hideki Yanasse
On a pattern sequencing problem to minimize the maximum number of open stacks. Eur. J. Oper. Res. 100(3): 454-463 (1997) - 1995
- [j3]Nei Yoshihiro Soma
A Polynomial Approximation Scheme for the Subset Sum Problem. Discret. Appl. Math. 57(2-3): 243-253 (1995)
1980 – 1989
- 1987
- [j2]Horacio Hideki Yanasse
A new enumeration scheme for the knapsack problem. Discret. Appl. Math. 18(2): 235-245 (1987) - 1984
- [j1]Gabriel R. Bitran, Horacio Hideki Yanasse
Deterministic Approximations to Stochastic Production Problems. Oper. Res. 32(5): 999-1018 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: