Rommel Dias Saraiva

Orcid: 0000-0002-1089-0129

According to our database1, Rommel Dias Saraiva authored at least 11 papers between 2012 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Valid inequalities for the k-Color Shortest Path Problem.
Eur. J. Oper. Res., 2024

2021
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics.
Int. Trans. Oper. Res., 2021

2020
MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles.
Ann. Oper. Res., 2020

Map Generation and Balance in the Terra Mystica Board Game Using Particle Swarm and Local Search.
Proceedings of the Advances in Swarm Intelligence - 11th International Conference, 2020

Using Ant Colony Optimisation for map generation and improving game balance in the Terra Mystica and Settlers of Catan board games.
Proceedings of the FDG '20: International Conference on the Foundations of Digital Games, 2020

2019
A Two-Phase Approach for Single Container Loading with Weakly Heterogeneous Boxes.
Algorithms, 2019

2018
An integer linear programming model for the constrained shortest path tour problem.
Electron. Notes Discret. Math., 2018

2016
A random-key genetic algorithm for solving the nesting problem.
Int. J. Comput. Integr. Manuf., 2016

2013
The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

Tackling the Irregular Strip Packing problem by hybridizing genetic algorithm and bottom-left heuristic.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A novel application of crossover operator to a hybrid optimization framework: Investigation into cutting problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012


  Loading...