Towards objective measures of algorithm performance across instance space
From MaRDI portal
Publication:336954
DOI10.1016/j.cor.2013.11.015zbMath1348.90646OpenAlexW2071948161WikidataQ62033354 ScholiaQ62033354MaRDI QIDQ336954
Davaatseren Baatar, Brendan Wreford, Rhyd Lewis, Kate A. Smith-Miles
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/53966/1/LEWIS%20towards%20objective%20measures%20of%20algorithm%20performance%20across%20instance%20space.pdf
Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (27)
ASlib: a benchmark library for algorithm selection ⋮ A new class of hard problem instances for the 0-1 knapsack problem ⋮ Anomaly Detection in High-Dimensional Data ⋮ Water wave optimization: a new nature-inspired metaheuristic ⋮ Generating new test instances by evolving in instance space ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ Enhanced instance space analysis for the maximum flow problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem ⋮ The international timetabling competition on sports timetabling (ITC2021) ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ Instance spaces for machine learning classification ⋮ On normalization and algorithm selection for unsupervised outlier detection ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Metaheuristics ``In the large ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis ⋮ A hybrid heuristic for the maximum dispersion problem ⋮ Statistical learning for recommending (robust) nonlinear regression methods ⋮ Instance space analysis for a personnel scheduling problem ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ Relating instance hardness to classification performance in a dataset: a visual approach ⋮ Evolving test instances of the Hamiltonian completion problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploring the role of graph spectra in graph coloring algorithm performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- An introduction to timetabling
- Learning dynamic algorithm portfolios
- Facet defining inequalities among graph invariants: The system graphedron
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Some models of graphs for scheduling sports competitions
- Self-organized formation of topologically correct feature maps
- An algorithm for finding a maximum clique in a graph
- The energy of a graph
- House of Graphs: a database of interesting graphs
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Measuring instance difficulty for combinatorial optimization problems
- A no-free-lunch theorem for non-uniform distributions of target functions
- GAUSS: an online algorithm selection system for numerical quadrature
- Principal component analysis.
- Testing heuristics: We have it all wrong
- Hybrid evolutionary algorithms for graph coloring
- A graph-based hyper-heuristic for educational timetabling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An improved ant colony optimisation heuristic for graph colouring
- A survey of metaheuristic-based techniques for university timetabling problems
- Generating Applicable Synthetic Instances for Branch Problems
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Needed: An Empirical Science of Algorithms
- PYTHIA
- 10.1162/153244303322753616
- 10.1162/153244303322753634
This page was built for publication: Towards objective measures of algorithm performance across instance space
