Generating new test instances by evolving in instance space
DOI10.1016/J.COR.2015.04.022zbMATH Open1349.68325DBLPjournals/cor/Smith-MilesB15OpenAlexW815914887WikidataQ62033329 ScholiaQ62033329MaRDI QIDQ342041FDOQ342041
Authors: Simon Bowly, Kate A. Smith-Miles 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.022
Recommendations
- Evolving test instances of the Hamiltonian completion problem
- Towards objective measures of algorithm performance across instance space
- Core instances for testing: a case study
- scientific article; zbMATH DE number 1982188
- Discovering the suitability of optimisation algorithms by learning from evolved instances
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- The linear ordering problem: instances, search space analysis and algorithms
- Testing heuristics: We have it all wrong
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Facet defining inequalities among graph invariants: The system graphedron
- Towards objective measures of algorithm performance across instance space
- Measuring instance difficulty for combinatorial optimization problems
- Old and new results on algebraic connectivity of graphs
- The energy of a graph
- A supernodal formulation of vertex colouring with applications in course timetabling
- Generating applicable synthetic instances for branch problems
- Synthetic optimization problem generation: show us the correlations!
- 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
- Some relations between rank, chromatic number and energy of graphs
- Maximal energy bipartite graphs
- A mixed evolutionary-statistical analysis of an algorithm's complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Title not available (Why is that?)
- Evolutionary Computation in Combinatorial Optimization
- What makes an optimization problem hard?.
Cited In (23)
- Instance space analysis for 2D bin packing mathematical models
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Evolving test instances of the Hamiltonian completion problem
- A new class of hard problem instances for the 0-1 knapsack problem
- Title not available (Why is that?)
- Towards objective measures of algorithm performance across instance space
- 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
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Core instances for testing: a case study
- Instance space analysis for a personnel scheduling problem
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Title not available (Why is that?)
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Enhanced instance space analysis for the maximum flow problem
- Generation techniques for linear programming instances with controllable properties
- 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
- Instance spaces for machine learning classification
- Relating instance hardness to classification performance in a dataset: a visual approach
- 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: Generating new test instances by evolving in instance space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342041)
