Albert Einstein Fernandes Muritiba

Orcid: 0000-0003-0528-9248

Affiliations:
  • Federal University of Ceará, Fortaleza, CE, Brazil


According to our database1, Albert Einstein Fernandes Muritiba authored at least 9 papers between 2008 and 2022.

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

2022
Path-relinking with tabu search for the capacitated centered clustering problem.
Expert Syst. Appl., 2022

2021
Branch-and-Cut and Iterated Local Search for the Weighted <i>k</i>-Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras.
Transp. Sci., 2021

2019
Branch-and-cut and iterated local search for the weighted k-traveling repairman problem: an application to the maintenance of speed cameras.
CoRR, 2019

2018
A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem.
Comput. Oper. Res., 2018

2011
A multistart heuristic for the equality generalized traveling salesman problem.
Networks, 2011

A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU.
Proceedings of the 23rd International Symposium on Computer Architecture and High Performance Computing, 2011

2010
Algorithms for the Bin Packing Problem with Conflicts.
INFORMS J. Comput., 2010

Models and algorithms for fair layout optimization problems.
Ann. Oper. Res., 2010

2008
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008


  Loading...