A neural network for the minimum set covering problem

Chaos, Solitons and Fractals

Volumn 11, Issue 13, 2000, Pages 2079-2089

  Hifi, Mhand ^a   Paschos, Th Vangelis ^b   Zissimopoulos, Vassilis ^c  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; NEURAL NETWORKS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BOLTZMAN MACHINE; SET COVERING PROBLEM;

FRACTALS;

EID: 0033688736     PISSN: 09600779     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0960-0779(99)00104-6     Document Type: Article

References (23)

1. Aarts E, Korst J. Simulated annealing and Boltzmann machines a stochastic approach to combinational optimization and neural computing. Chichester, UK: Wiley, 1989.
2. Ackley D, Hinton G, Senjonwski T. A learning algorithm for Boltzmann machines. Cognitive Sci 1985;9:147-69.
3. Balas E, Ho A. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Math Programming 1980;12:37-60.
4. Beasley JE. An algorithm for set covering problem. Eur J Oper Res 1987;31:85-93.
5. Beasley JE. A Lagrangian heuristic for set covering problem. Naval Res Logist 1990;37:151-64.
6. Beasley JE, Chu PC. A genetic algorithm for the set covering problem. Technical report. The Management School, Imperial College, 1995.
7. Bertolazzi P, Sassano A. A class of polynomially solvable set-covering problems. SIAM J Discrete Math 1988;1:306-16.
8. Bertolazzi P, Sassano A. A decomposition strategy for the vertex cover problem. Inform Process Lett 1989;31:299-304.
9. Bertoni A, Campadelli P, Grassani F. Full parallelism in Boltzmann machines. In: Proc Neuro-Nimes, 1989:361-70.
10. Bruck J, Goodman JW. On the power of neural networks for solving hard problems. J Complexity 1990;6:129-35.
11. Christofides N, Paixão J. Algorithms for large scale set covering problems. Ann Oper Res 1993;43:261-77.
12. Chvátal V. A greedy-heuristic for the set covering problem. Math Oper Res 1979;4:233-5.
13. Jacobs LW, Brusco MJ. A local search heuristic for large set covering problems. Naval Res Logist 1995;42:1129-40.
14. Johnson DS. Approximation algorithms for combinatorial problems. J Comput System Sci 1974;9:256-78.
15. Likas A, Stafylopatis A. Group updates and multiscaling: An efficient neural network approach to combinatorial optimization. IEEE Trans Systems Man Cybernet 1996;26(2):222-32.
16. Papadimitriou CH, Steiglitz K. Combinatorial optimization: Algorithms and complexity. Englewood Cliffs, NJ: Prentice-Hall, 1981.
17. Raz R, Safra S. A sub-constant error probability low-degree test and a sub-constant error probability PCP characterization of NP. In: Proc STOC'97, 1997:475-484.
18. Rumelhart DE, McClelland JL, the PDP Research Group. Parallel distributed processing. Cambridge, MA: MIT Press, 1986.
19. Sapiecha PK. An approximation algorithm for a certain class of NP-hard problems. Found Comput Decision Sci 1993; 18(3/4):332-41.
20. Slavík P. A tight analysis of the greedy algorithm for set cover. In: Proc STOC'96, 1989:435-41.
21. Vasko FJ, Wilson GR. Hybrid heuristics for minimum cardinality set covering problems. Naval Res Logist Quart 1986;33:241-9.
22. Yao X. Finding approximate solutions to NP-hard problems by neural networks is hard. Inform Process Lett 1992;46:93-8.
23. Zissimopoulos V, Paschos VT, Pekergin F. On the approximation of NP-complete problems by using Boltzmann machine method: The cases of some covering and packing problems. IEEE Trans Comput 1991;40:1413-8.