default search action
Adriana Cristina Cherri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Douglas Nogueira do Nascimento
, Adriana Cristina Cherri
The two-dimensional cutting stock problem with usable leftovers and uncertainty in demand. Comput. Ind. Eng. 186: 109705 (2023) - [j15]Pedro Rochavetz de Lara Andrade
The cutting stock problem applied to the hardening process in an automotive spring factory. Central Eur. J. Oper. Res. 31(2): 637-664 (2023) - [j14]Carlos Diego Rodrigues, Adriana Cristina Cherri
Strip based compact formulation for two-dimensional guillotine cutting problems. Comput. Oper. Res. 149: 106044 (2023) - [j13]Adriana Cristina Cherri
A stochastic programming approach to the cutting stock problem with usable leftovers. Eur. J. Oper. Res. 308(1): 38-53 (2023) - [j12]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) - [j11]Heloisa Vasques da Silva
Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes. RAIRO Oper. Res. 57(1): 183-200 (2023) - 2022
- [j10]Douglas Nogueira do Nascimento
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers. Ann. Oper. Res. 316(2): 785-803 (2022) - [j9]Douglas Nogueira do Nascimento
The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches. Oper. Res. 22(5): 5363-5403 (2022) - 2021
- [j8]Felipe Kesrouani Lemos
The cutting stock problem with multiple manufacturing modes applied to a construction industry. Int. J. Prod. Res. 59(4): 1088-1106 (2021) - [j7]Maurício Móz Christofoletti
Integrated lot-sizing and cutting stock problem applied to the mattress industry. J. Oper. Res. Soc. 72(6): 1279-1293 (2021)
2010 – 2019
- 2018
- [j6]Luiz Henrique Cherri
An innovative data structure to handle the geometry of nesting problems. Int. J. Prod. Res. 56(23): 7085-7102 (2018) - [j5]Luiz Henrique Cherri
Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. J. Glob. Optim. 72(1): 89-107 (2018) - 2017
- [j4]E. Santoro, Edilaine Martins Soler, Adriana Cristina Cherri:
Route optimization in mechanized sugarcane harvesting. Comput. Electron. Agric. 141: 140-146 (2017) - 2014
- [j3]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) - 2013
- [j2]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)
2000 – 2009
- 2009
- [b1]Adriana Cristina Cherri Nicola:
Some extensions of the cutting stock problem with usable leftovers. University of São Paulo, Brazil, 2009 - [j1]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)
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-04-25 05:55 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: