default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlinto César Bassi de Araújo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Alberto Francisco Kummer Neto
, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the home health care problem. Int. Trans. Oper. Res. 31(3): 1859-1889 (2024)- [j14]Henrique Becker, Mateus Martin, Olinto C. B. de Araújo, Luciana S. Buriol, Reinaldo Morabito:
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem. Int. Trans. Oper. Res. 31(5): 3010-3035 (2024) - 2023
- [i3]Henrique Becker, Mateus Martin, Olinto César Bassi de Araújo, Luciana S. Buriol, Reinaldo Morabito:
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem. CoRR abs/2308.04965 (2023) - 2022
- [j13]Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol:
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem. Math. Program. Comput. 14(4): 673-697 (2022) - [i2]Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the home health care problem. CoRR abs/2206.14347 (2022) - 2021
- [j12]Renan Spencer Trindade, Olinto César Bassi de Araújo, Marcia Fampa:
Arc-flow approach for single batch-processing machine scheduling. Comput. Oper. Res. 134: 105394 (2021) - [c5]Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol:
Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem. LAGOS 2021: 499-507 - [i1]Henrique Becker, Olinto César Bassi de Araújo, Luciana S. Buriol:
Enhanced Formulation for Guillotine 2D Cutting Problems. CoRR abs/2111.06348 (2021) - 2020
- [c4]Alberto Francisco Kummer Neto, Luciana S. Buriol, Olinto César Bassi de Araújo:
A biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints. GECCO 2020: 717-724 - [c3]Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa:
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. ISCO 2020: 179-190
2010 – 2019
- 2019
- [j11]Guilherme Dhein, Marcelo Serrano Zanetti, Olinto César Bassi de Araújo, Ghendy Cardoso:
Minimizing dispersion in multiple drone routing. Comput. Oper. Res. 109: 28-42 (2019) - [j10]Pablo Cristini Guedes, Denis Borenstein, Monize Sâmara Visentini, Olinto César Bassi de Araújo, Alberto Francisco Kummer Neto:
Vehicle scheduling problem with loss in bus ridership. Comput. Oper. Res. 111: 230-242 (2019) - 2018
- [j9]Guilherme Dhein, Alberto Francisco Kummer Neto, Olinto César Bassi de Araújo:
The Multiple Traveling Salesman Problem with Backup Coverage. Electron. Notes Discret. Math. 66: 135-142 (2018) - [j8]Guilherme Dhein, Olinto César Bassi de Araújo, Ghendy Cardoso:
Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles. Expert Syst. Appl. 92: 276-288 (2018) - [j7]Renan Spencer Trindade, Olinto César Bassi de Araújo, Marcia Helena Costa Fampa, Felipe Martins Müller:
Modelling and symmetry breaking in scheduling problems on batch processing machines. Int. J. Prod. Res. 56(22): 7031-7048 (2018) - 2017
- [j6]Árton P. Dorneles, Olinto César Bassi de Araújo, Luciana S. Buriol:
A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur. J. Oper. Res. 256(3): 685-695 (2017) - 2015
- [j5]Fernando Stefanello, Olinto César Bassi de Araújo, Felipe Martins Müller:
Matheuristics for the capacitated p-median problem. Int. Trans. Oper. Res. 22(1): 149-167 (2015) - 2014
- [j4]Árton P. Dorneles, Olinto César Bassi de Araújo, Luciana S. Buriol:
A fix-and-optimize heuristic for the high school timetabling problem. Comput. Oper. Res. 52: 29-38 (2014) - 2013
- [j3]Viviane Köhler, Marcia Fampa, Olinto C. B. de Araújo:
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem. Comput. Optim. Appl. 55(1): 113-135 (2013) - 2011
- [c2]Felipe Martins Müller, Guilherme Dhein, Olinto César Bassi de Araújo:
Theoretical and Experimental Analysis of the Jurema Branch-and-Bound Method. WEIT 2011: 102-107 - [c1]Renan Spencer Trindade, Guilherme Dhein, Felipe Martins Müller, Olinto César Bassi de Araújo:
Mixed Integer Linear Programming Models to Solve the Shisen-Sho Puzzle. WEIT 2011: 108-112
2000 – 2009
- 2006
- [j2]Vinícius Amaral Armentano, Olinto César Bassi de Araújo:
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. J. Heuristics 12(6): 427-446 (2006) - 2001
- [j1]Felipe Martins Müller, Mauro Marafiga Camozzato, Olinto César Bassi de Araújo:
Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem. Electron. Notes Discret. Math. 7: 122-125 (2001)
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-06-19 21:46 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:
