Towards objective measures of algorithm performance across instance space
From MaRDI portal
(Redirected from Publication:336954)
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
Cites work
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- 10.1162/153244303322753616
- 10.1162/153244303322753634
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A graph-based hyper-heuristic for educational timetabling problems
- A no-free-lunch theorem for non-uniform distributions of target functions
- A survey of metaheuristic-based techniques for university timetabling problems
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- An algorithm for finding a maximum clique in a graph
- An improved ant colony optimisation heuristic for graph colouring
- An introduction to timetabling
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Exploring the role of graph spectra in graph coloring algorithm performance
- Facet defining inequalities among graph invariants: The system graphedron
- GAUSS: an online algorithm selection system for numerical quadrature
- Generating applicable synthetic instances for branch problems
- House of Graphs: a database of interesting graphs
- Hybrid evolutionary algorithms for graph coloring
- Learning dynamic algorithm portfolios
- Measuring instance difficulty for combinatorial optimization problems
- Needed: An Empirical Science of Algorithms
- New methods to color the vertices of a graph
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- PYTHIA
- Principal component analysis.
- SATzilla: portfolio-based algorithm selection for SAT
- Self-organized formation of topologically correct feature maps
- Some models of graphs for scheduling sports competitions
- Testing heuristics: We have it all wrong
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The energy of a graph
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
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
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- 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
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Anomaly Detection in High-Dimensional Data
- Instance space analysis for a personnel scheduling problem
- Water wave optimization: a new nature-inspired metaheuristic
- Exploring the role of graph spectra in graph coloring algorithm performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Automated streamliner portfolios for constraint satisfaction problems
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Generating new test instances by evolving in instance space
- A biased random-key genetic algorithm for the container pre-marshalling problem
- Instance space analysis for the car sequencing problem
- Enhanced instance space analysis for the maximum flow problem
- Statistical learning for recommending (robust) nonlinear regression methods
- On normalization and algorithm selection for unsupervised outlier detection
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- 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
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- On the impact of initialisation strategies on maximum flow algorithm performance
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
Describes a project that uses
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)
