Felipe Martins Müller

Orcid: 0000-0003-0062-5863

According to our database1, Felipe Martins Müller authored at least 19 papers between 1993 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
GATeS: A Hybrid Algorithm Based on Genetic Algorithm and Tabu Search for the Direct Marketing Problem.
IEEE Access, 2024

2022
Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems.
Algorithms, 2022

2020
Ant Colony optimization with Heuristic Repair for the Dynamic Vehicle Routing Problem.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

On the Multiple Possible Adaptive Mechanisms of the Continuous Ant Colony Optimization.
Proceedings of the Intelligent Systems - 9th Brazilian Conference, 2020

Evaluation of Metaheuristics in the Optimization of Laguerre-Volterra Networks for Nonlinear Dynamic System Identification.
Proceedings of the Intelligent Systems - 9th Brazilian Conference, 2020

2019
Effective ACO-Based Memetic Algorithms for Symmetric and Asymmetric Dynamic Changes.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

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

2017
Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.
IEEE Trans. Cybern., 2017

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

An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
Regularidades E Transformações EM HipermíDIA educacional.
Revista Brasileira de Informática na Educ., 2014

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

2002
DEVOpT: a distributed architecture supporting heuristic and metaheuristic optimization methods.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

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

2000
A Federated Architecture for Autonomous Optimization Centers.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1995
The <i>m</i>-Traveling Salesman Problem with Minmax Objective.
Transp. Sci., 1995

1994
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.
Comput. Oper. Res., 1994

1993
Algoritmos heuristicos e exatos para resolução do problema de sequenciamento em processadores paralelos.
PhD thesis, 1993


  Loading...