Related references
Note: Only part of the references are listed.Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection
Isaias I. Huerta et al.
EXPERT SYSTEMS WITH APPLICATIONS (2022)
A differentiable approach to the maximum independent set problem using dataless neural networks
Ismail R. Alkhouri et al.
NEURAL NETWORKS (2022)
Dynamic Approximate Maximum Independent Set on Massive Graphs
Xiangyu Gao et al.
2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022) (2022)
Combinatorial optimization with physics-inspired graph neural networks
Martin J. A. Schuetz et al.
NATURE MACHINE INTELLIGENCE (2022)
Conflict resolving - A local search algorithm for solving large scale conflict graphs in freight railway timetabling
Julian Reisch et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming
Martin Hughes et al.
COMPUTERS & OPERATIONS RESEARCH (2021)
On the analysis of ant colony optimization for the maximum independent set problem
Xiaoyun Xia et al.
FRONTIERS OF COMPUTER SCIENCE (2021)
Automatic design of specialized algorithms for the binary knapsack problem
Nicolas Acevedo et al.
EXPERT SYSTEMS WITH APPLICATIONS (2020)
The General Combinatorial Optimization Problem: Towards Automated Algorithm Design
Rong Qu et al.
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE (2020)
Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review
J. Carrasco et al.
SWARM AND EVOLUTIONARY COMPUTATION (2020)
ARJA: Automated Repair of Java Programs via Multi-Objective Genetic Programming
Yuan Yuan et al.
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (2020)
Anytime automatic algorithm selection for knapsack
Isaias I. Huerta et al.
EXPERT SYSTEMS WITH APPLICATIONS (2020)
Novel Algorithms Automatically Generated for Optimization Problems
Moises Silva-Munoz et al.
2019 38TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC) (2019)
Genetic Programming Proof Search Automatic Improvement
Zoltan A. Kocsis et al.
JOURNAL OF AUTOMATED REASONING (2018)
Finding near-optimal independent sets at scale
Sebastian Lamm et al.
JOURNAL OF HEURISTICS (2017)
Evolution of new algorithms for the binary knapsack problem
Lucas Parada et al.
NATURAL COMPUTING (2016)
Evolution of new algorithms for the binary knapsack problem
Lucas Parada et al.
NATURAL COMPUTING (2016)
Automatic design of algorithms for the traveling salesman problem
Cristian Loyola et al.
COGENT ENGINEERING (2016)
General swap-based multiple neighborhood tabu search for the maximum independent set problem
Yan Jin et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2015)
Automatic design of algorithms for optimization problems
Carlos Contreras-Bolton et al.
2015 LATIN AMERICA CONGRESS ON COMPUTATIONAL INTELLIGENCE (LA-CCI) (2015)
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
Shaowei Cai et al.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2013)
Automatically Generated Algorithms for the Vertex Coloring Problem
Carlos Contreras Bolton et al.
PLOS ONE (2013)
Fast local search for the maximum independent set problem
Diogo V. Andrade et al.
JOURNAL OF HEURISTICS (2012)
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
Joaquin Derrac et al.
SWARM AND EVOLUTIONARY COMPUTATION (2011)
A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization
Salvador Garcia et al.
JOURNAL OF HEURISTICS (2009)
Uniform integration of genome mapping data using intersection graphs
E Harley et al.
BIOINFORMATICS (2001)