A neural network for the minimum set covering problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 597806 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Class of Polynomially Solvable Set-Covering Problems
- A Greedy Heuristic for the Set-Covering Problem
- A decomposition strategy for the vertex cover problem
- Algorithms for large scale set covering problems
- An algorithm for set covering problem
- Approximation algorithms for combinatorial problems
- Finding approximate solutions to NP-hard problems by neural networks is hard
- Hybrid heuristics for minimum cardinality set covering problems
- Note: A local-search heuristic for large set-covering problems
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
- On the power of neural networks for solving hard problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
Cited in
(9)- The construction of minimal multilayered perceptrons: A case study for sorting
- scientific article; zbMATH DE number 1974052 (Why is no real title available?)
- scientific article; zbMATH DE number 5670055 (Why is no real title available?)
- A primer on the application of neural networks to covering array generation
- An efficient mean field approach to the set covering problem
- Searching sets of properties with neural networks
- Performance of a neural network method with set partitioning
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Surrogate constraint normalization for the set covering problem
This page was built for publication: A neural network for the minimum set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577203)