Olinto César Bassi de Araújo

Orcid: 0000-0003-1136-5032

According to our database1, Olinto César Bassi de Araújo authored at least 21 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem.
Int. Trans. Oper. Res., September, 2024

A biased random-key genetic algorithm for the home health care problem.
Int. Trans. Oper. Res., May, 2024

2022
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem.
Math. Program. Comput., 2022

2021
Enhanced Formulation for Guillotine 2D Cutting Problems.
CoRR, 2021

Arc-flow approach for single batch-processing machine scheduling.
Comput. Oper. Res., 2021

Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

A biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Vehicle scheduling problem with loss in bus ridership.
Comput. Oper. Res., 2019

Minimizing dispersion in multiple drone routing.
Comput. Oper. Res., 2019

2018
Modelling and symmetry breaking in scheduling problems on batch processing machines.
Int. J. Prod. Res., 2018

Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles.
Expert Syst. Appl., 2018

The Multiple Traveling Salesman Problem with Backup Coverage.
Electron. Notes Discret. Math., 2018

2017
A column generation approach to high school timetabling modeled as a multicommodity flow problem.
Eur. J. Oper. Res., 2017

2015
Matheuristics for the capacitated p-median problem.
Int. Trans. Oper. Res., 2015

2014
A fix-and-optimize heuristic for the high school timetabling problem.
Comput. Oper. Res., 2014

2013
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem.
Comput. Optim. Appl., 2013

2011
Mixed Integer Linear Programming Models to Solve the Shisen-Sho Puzzle.
Proceedings of the 2011 Workshop-School on Theoretical Computer Science, 2011

Theoretical and Experimental Analysis of the Jurema Branch-and-Bound Method.
Proceedings of the 2011 Workshop-School on Theoretical Computer Science, 2011

2006
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times.
J. Heuristics, 2006

2001
Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem.
Electron. Notes Discret. Math., 2001


  Loading...