default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Andretta
Person information
- affiliation: University of São Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Marina Andretta:
Topics on linearly-constrained optimization. University of São Paulo, Brazil, 2008
Journal Articles
- 2022
- [j8]Layane Rodrigues de Souza Queiroz
, Marina Andretta:
A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. Int. Trans. Oper. Res. 29(6): 3486-3513 (2022) - 2021
- [j7]Danilo Tedeschi, Marina Andretta:
New exact algorithms for planar maximum covering location by ellipses problems. Eur. J. Oper. Res. 291(1): 114-127 (2021) - 2020
- [j6]Layane Rodrigues de Souza Queiroz, Marina Andretta:
Two effective methods for the irregular knapsack problem. Appl. Soft Comput. 95: 106485 (2020) - 2018
- [j5]Leandro Resende Mundim, Marina Andretta, Maria Antónia Carravilla, José Fernando Oliveira:
A general heuristic for two-dimensional nesting problems with limited-size containers. Int. J. Prod. Res. 56(1-2): 709-732 (2018) - 2017
- [j4]Leandro Resende Mundim, Marina Andretta, Thiago Alves de Queiroz:
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81: 358-371 (2017) - 2016
- [j3]Luiz Henrique Cherri, Leandro Resende Mundim, Marina Andretta, Franklina Maria Bragion Toledo, José Fernando Oliveira, Maria Antónia Carravilla:
Robust mixed-integer linear programming models for the irregular strip packing problem. Eur. J. Oper. Res. 253(3): 570-583 (2016) - 2013
- [j2]Marina Andretta, Ernesto G. Birgin:
Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. Eur. J. Oper. Res. 224(1): 23-40 (2013) - 2010
- [j1]Marina Andretta, Ernesto G. Birgin, José Mario Martínez:
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization. Numer. Algorithms 53(1): 23-52 (2010)
Conference and Workshop Papers
- 2021
- [c3]Wesley H. B. Nunes, Mayron C. O. Moreira, Marina Andretta:
A Genetic Algorithm for the Nesting Problem With Continuous Rotations. CEC 2021: 1107-1114 - 2018
- [c2]Layane Rodrigues de Souza Queiroz, Leandro Resende Mundim, Marina Andretta:
Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items. CLEI 2018: 192-199 - [c1]Jeinny Peralta, Marina Andretta, José Fernando Oliveira:
Packing Circles and Irregular Polygons using Separation Lines. ICORES 2018: 71-77
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-24 22:52 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:
