Towards objective measures of algorithm performance across instance space
From MaRDI portal
Publication:336954
DOI10.1016/J.COR.2013.11.015zbMATH Open1348.90646DBLPjournals/cor/Smith-MilesBWL14OpenAlexW2071948161WikidataQ62033354 ScholiaQ62033354MaRDI QIDQ336954FDOQ336954
Authors: 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
Recommendations
- Generating new test instances by evolving in instance space
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- Benchmarking deterministic optimization algorithms using an outranking approach
- Measuring instance difficulty for combinatorial optimization problems
- scientific article; zbMATH DE number 3912142
Approximation methods and heuristics in mathematical programming (90C59) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)
Cites Work
- House of Graphs: a database of interesting graphs
- PYTHIA
- GAUSS: an online algorithm selection system for numerical quadrature
- Principal component analysis.
- Title not available (Why is that?)
- 10.1162/153244303322753616
- Self-organized formation of topologically correct feature maps
- Testing heuristics: We have it all wrong
- Title not available (Why is that?)
- Facet defining inequalities among graph invariants: The system graphedron
- SATzilla: portfolio-based algorithm selection for SAT
- Learning dynamic algorithm portfolios
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Title not available (Why is that?)
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Measuring instance difficulty for combinatorial optimization problems
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An improved ant colony optimisation heuristic for graph colouring
- The energy of a graph
- An introduction to timetabling
- 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
- An algorithm for finding a maximum clique in a graph
- A no-free-lunch theorem for non-uniform distributions of target functions
- Generating applicable synthetic instances for branch problems
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- Exploring the role of graph spectra in graph coloring algorithm performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Needed: An Empirical Science of Algorithms
- 10.1162/153244303322753634
Cited In (34)
- Instance space analysis for 2D bin packing mathematical models
- Evolving test instances of the Hamiltonian completion problem
- A new class of hard problem instances for the 0-1 knapsack problem
- ASlib: a benchmark library for algorithm selection
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- The international timetabling competition on sports timetabling (ITC2021)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Metaheuristics ``In the large
- Anomaly Detection in High-Dimensional Data
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Instance space analysis for a personnel scheduling problem
- Water wave optimization: a new nature-inspired metaheuristic
- Automated streamliner portfolios for constraint satisfaction problems
- Exploring the role of graph spectra in graph coloring algorithm performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Instance space analysis for the car sequencing problem
- 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
- Statistical learning for recommending (robust) nonlinear regression methods
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- On normalization and algorithm selection for unsupervised outlier detection
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- Instance spaces for machine learning classification
- Relating instance hardness to classification performance in a dataset: a visual approach
- A hybrid heuristic for the maximum dispersion problem
- On the impact of initialisation strategies on maximum flow algorithm performance
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
Uses Software
This page was built for publication: Towards objective measures of algorithm performance across instance space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336954)
