A primer on the application of neural networks to covering array generation
From MaRDI portal
Publication:5043857
DOI10.1080/10556788.2021.1907384OpenAlexW3145571803MaRDI QIDQ5043857
No author found.
Publication date: 6 October 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1907384
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
- Constraint models for the covering test problem
- Constructing strength three covering arrays with augmented annealing
- Covering arrays from cyclotomy
- Finding approximate solutions to NP-hard problems by neural networks is hard
- Upper bounds for covering arrays by tabu search.
- A neural network for the minimum set covering problem
- Covering arrays via set covers
- Metaheuristics: A bibliography
- Problems and algorithms for covering arrays via set covers
- A survey on the problems and algorithms for covering arrays via set covers
- A threshold of ln n for approximating set cover
- Convergence of an annealing algorithm
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Artificial Neural Networks for Combinatorial Optimization
- Algebraic Modelling of Covering Arrays
- Neurons with graded response have collective computational properties like those of two-state neurons.
This page was built for publication: A primer on the application of neural networks to covering array generation
