default search action
Mustafa Misir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c31]Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen:
Q-Learning Based Framework for Solving the Stochastic E-waste Collection Problem. EvoStar 2024: 49-64 - [c30]Zhongyi Hu, Fangrui Dong, Jiang Wu, Mustafa Misir:
Prediction of Banking Customer Churn Based on XGBoost with Feature Fusion. WHICEB (3) 2024: 159-167 - [c29]Zhongyi Hu, Xue Li, Mustafa Misir:
Tourism Demand Forecasting with Multi-terminal Search Query Data and Deep Learning. WHICEB (3) 2024: 421-431 - 2023
- [c28]Pham Kien Minh Nguyen, Aldy Gunawan, Vincent F. Yu, Mustafa Misir:
An Adaptive Large Neighborhood Search for Heterogeneous Vehicle Routing Problem with Time Windows. CASE 2023: 1-6 - [c27]Jingwei Li, Yuanjun Lin, Mustafa Misir:
Neural Network Based Heuristic Selection for Selection Hyper-Heuristics. CEC 2023: 1-7 - [c26]Mustafa Misir, Xinye Cai:
Algorithm Selection for Large-Scale Multi-objective Optimization. OLA 2023: 36-47 - [c25]Mustafa Misir:
Characterization of CEC Single-Objective Optimization Competition Benchmarks and Algorithms. SSCI 2023: 369-374 - 2022
- [c24]Mustafa Misir:
Automated Portfolio Generation for Selection Hyper-heuristics: an Application to Protein Structure Prediction on 2D HP Model. CIBCB 2022: 1-8 - [c23]Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen:
Algorithm Selection for the Team Orienteering Problem. EvoCOP 2022: 33-45 - [c22]Mustafa Misir:
Algorithm Selection across Algorithm Configurators A Case Study on Multi-objective Optimization. SSCI 2022: 1-5 - [c21]Mustafa Misir:
Cross-domain Algorithm Selection: Algorithm Selection across Selection Hyper-heuristics. SSCI 2022: 22-29 - 2021
- [j9]Xinye Cai, Wenxue Sun, Mustafa Misir, Kay Chen Tan, Xiaoping Li, Tao Xu, Zhun Fan:
A Bi-Objective Constrained Robust Gate Assignment Problem: Formulation, Instances and Algorithm. IEEE Trans. Cybern. 51(9): 4488-4500 (2021) - [c20]Mustafa Misir:
Benchmark Set Reduction for Cheap Empirical Algorithmic Studies. CEC 2021: 871-877 - [c19]Mustafa Misir:
Algorithm Selection on Adaptive Operator Selection: A Case Study on Genetic Algorithms. LION 2021: 237-251 - [c18]Mustafa Misir:
Selection-based Per-Instance Heuristic Generation for Protein Structure Prediction of 2D HP Model. SSCI 2021: 1-6 - [c17]Mustafa Misir:
Generalized Automated Energy Function Selection for Protein Structure Prediction on 2D and 3D HP Models. SSCI 2021: 1-6 - [p2]Mustafa Misir:
Hyper-heuristics: Autonomous Problem Solvers. Automated Design of Machine Learning and Search Algorithms 2021: 109-131
2010 – 2019
- 2019
- [c16]Mustafa Misir:
Active Matrix Completion for Algorithm Selection. LOD 2019: 321-334 - [p1]Mustafa Misir, Hoong Chuin Lau:
Towards Personalized Data-Driven Bundle Design with QoS Constraint. Business and Consumer Analytics: New Ideas 2019: 865-909 - 2018
- [j8]Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, Frank Hutter:
A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3): 295-320 (2018) - 2017
- [j7]Mustafa Misir, Michèle Sebag:
Alors: An algorithm recommender system. Artif. Intell. 244: 291-314 (2017) - [c15]Mustafa Misir:
Data sampling through collaborative filtering for algorithm selection. CEC 2017: 2494-2501 - [c14]Muhammad Sulaman, Xinye Cai, Mustafa Misir, Zhun Fan:
Simulated Annealing with a Time-Slot Heuristic for Ready-Mix Concrete Delivery. SEAL 2017: 39-50 - [c13]Mustafa Misir:
Matrix Factorization Based Benchmark Set Analysis: A Case Study on HyFlex. SEAL 2017: 184-195 - [c12]Wenxue Sun, Xinye Cai, Chao Xia, Muhammad Sulaman, Mustafa Misir, Zhun Fan:
Greedy Based Pareto Local Search for Bi-objective Robust Airport Gate Assignment Problem. SEAL 2017: 694-705 - 2016
- [c11]Ahmed Kheiri, Mustafa Misir, Ender Özcan:
Ensemble Move Acceptance in Selection Hyper-heuristics. ISCIS 2016: 21-29 - [c10]Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir:
Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm Selection. LION 2016: 91-106 - [i1]Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, Frank Hutter:
A case study of algorithm selection for the traveling thief problem. CoRR abs/1609.00462 (2016) - 2015
- [j6]Mustafa Misir, Pieter Smet, Greet Vanden Berghe:
An analysis of generalised heuristics for vehicle routing and personnel rostering problems. J. Oper. Res. Soc. 66(5): 858-870 (2015) - [c9]Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir:
Designing a Portfolio of Parameter Configurations for Online Algorithm Selection. AAAI Workshop: Algorithm Configuration 2015 - [c8]Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau:
ADVISER: A Web-Based Algorithm Portfolio Deviser. LION 2015: 23-28 - [c7]Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau:
OSCAR: Online Selection of Algorithm Portfolios with Case Study on Memetic Algorithms. LION 2015: 59-73 - 2014
- [c6]Joel Ribeiro, Josep Carmona, Mustafa Misir, Michèle Sebag:
A Recommender System for Process Discovery. BPM 2014: 67-83 - [c5]Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau:
Building algorithm portfolios for memetic algorithms. GECCO (Companion) 2014: 197-198 - 2013
- [j5]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl. Soft Comput. 13(7): 3335-3353 (2013) - [j4]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
A new hyper-heuristic as a general problem solver: an implementation in HyFlex. J. Sched. 16(3): 291-311 (2013) - [c4]Ender Ozcan, Mustafa Misir, Ahmed Kheiri:
Group decision making hyper-heuristics for function optimisation. UKCI 2013: 327-333 - 2012
- [b1]Mustafa Misir:
Intelligent hyper-heuristics: a tool for solving generic optimisation problems ; Intelligente hyper-heuristieken: een algoritmische aanpak voor generieke optimalisatieproblemen. Katholieke Universiteit Leuven, Belgium, 2012 - [j3]Edmund K. Burke, Graham Kendall, Mustafa Misir, Ender Özcan:
Monte Carlo hyper-heuristics for examination timetabling. Ann. Oper. Res. 196(1): 73-90 (2012) - [j2]Burak Bilgin, Peter Demeester, Mustafa Misir, Wim Vancroonenburg, Greet Vanden Berghe:
One hyper-heuristic approach to two timetabling problems in health care. J. Heuristics 18(3): 401-434 (2012) - [c3]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
An Intelligent Hyper-Heuristic Framework for CHeSC 2011. LION 2012: 461-466 - [c2]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
The Effect of the Set of Low-Level Heuristics on the Performance of Selection Hyper-heuristics. PPSN (2) 2012: 408-417 - 2010
- [j1]Ender Özcan, Mustafa Misir, Gabriela Ochoa, Edmund K. Burke:
A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling. Int. J. Appl. Metaheuristic Comput. 1(1): 39-59 (2010) - [c1]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-8
Coauthor Index
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-06-26 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint