![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Felipe Martins Müller
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Felipe Martins Müller
, Vanessa A. Schneider
, Iaê Santos Bonilha
, Veridiane Barbara De Souza, Greici Da Rosa Da Cruz
, Michalis Mavrovouniotis
:
GATeS: A Hybrid Algorithm Based on Genetic Algorithm and Tabu Search for the Direct Marketing Problem. IEEE Access 12: 20867-20884 (2024) - 2022
- [j8]Felipe Martins Müller
, Iaê Santos Bonilha:
Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems. Algorithms 15(1): 9 (2022) - 2020
- [c9]Victor Oliveira Costa
, Felipe Martins Müller
:
Evaluation of Metaheuristics in the Optimization of Laguerre-Volterra Networks for Nonlinear Dynamic System Identification. BRACIS 2020: 95-109 - [c8]Victor Oliveira Costa
, Felipe Martins Müller
:
On the Multiple Possible Adaptive Mechanisms of the Continuous Ant Colony Optimization. BRACIS 2020: 166-178 - [c7]Iaê Santos Bonilha, Michalis Mavrovouniotis, Felipe Martins Müller, Georgios Ellinas, Marios M. Polycarpou:
Ant Colony optimization with Heuristic Repair for the Dynamic Vehicle Routing Problem. SSCI 2020: 313-320
2010 – 2019
- 2019
- [c6]Michalis Mavrovouniotis, Iaê Santos Bonilha, Felipe Martins Müller, Georgios Ellinas, Marios M. Polycarpou:
Effective ACO-Based Memetic Algorithms for Symmetric and Asymmetric Dynamic Changes. CEC 2019: 2567-2574 - 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]Michalis Mavrovouniotis
, Felipe Martins Müller, Shengxiang Yang
:
Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems. IEEE Trans. Cybern. 47(7): 1743-1756 (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) - [c5]Michalis Mavrovouniotis
, Felipe Martins Müller, Shengxiang Yang:
An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem. GECCO 2015: 49-56 - 2014
- [j4]Ilse Abegg, Fábio Da Purificação de Bastos, Elena Maria Mallmann, Rosiclei Aparecida Cavichioli Lauermann, Sabrina Skrebsky Richter, Taís Fim Alberti, Felipe Martins Müller:
Regularidades E Transformações EM HipermíDIA educacional. Revista Brasileira de Informática na Educ. 22(1): 67-78 (2014) - 2011
- [c4]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 - [c3]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
- 2002
- [c2]Eder N. Mathias, Celso Maciel da Costa, Fernando Luís Dotti, Felipe Martins Müller:
DEVOpT: a distributed architecture supporting heuristic and metaheuristic optimization methods. SAC 2002: 870-875 - 2001
- [j3]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) - 2000
- [c1]Fernando Luís Dotti, Maurício de O. Cristal, Celso Maciel da Costa, Felipe Martins Müller:
A Federated Architecture for Autonomous Optimization Centers. PDPTA 2000
1990 – 1999
- 1995
- [j2]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
The m-Traveling Salesman Problem with Minmax Objective. Transp. Sci. 29(3): 267-275 (1995) - 1994
- [j1]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21(2): 205-210 (1994) - 1993
- [b1]Felipe Martins Müller:
Algoritmos heuristicos e exatos para resolução do problema de sequenciamento em processadores paralelos. University of Campinas, Brazil, 1993
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint