A neural network for the minimum set covering problem

DOI10.1016/S0960-0779(99)00104-6zbMath0951.68543OpenAlexW2024323609MaRDI QIDQ1577203

Mhand Hifi, Vangelis Th. Paschos, Vassilios Zissimopoulos

Publication date: 18 December 2000

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0960-0779(99)00104-6

zbMATH Keywords

weighted set covering problemBoltzmann machine

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Dynamical systems in biology (37N25)

Related Items

A primer on the application of neural networks to covering array generation ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Surrogate constraint normalization for the set covering problem

Cites Work

• On the power of neural networks for solving hard problems
• A decomposition strategy for the vertex cover problem
• Finding approximate solutions to NP-hard problems by neural networks is hard
• Approximation algorithms for combinatorial problems
• Algorithms for large scale set covering problems
• An algorithm for set covering problem
• Hybrid heuristics for minimum cardinality set covering problems
• A Class of Polynomially Solvable Set-Covering Problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item