This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems
December 1991 (vol. 40 no. 12)
pp. 1413-1418

A Boltzmann machine architecture to solve the problems of maximum independent set, set partitioning, clique, minimum vertex cover, minimum set cover, and maximum set packing is described. The authors evaluate the maximum and the average error of the method where the error is defined as the ratio of the cardinality of the obtained solution for an instance with respect to the optimal one. The results are compared with those obtained from the implementation of the heuristic described by D.S. Johnson (1974). The model treats the general case of all these problems that is the case when costs are associated with the data (vertices or subsets). The unweighted case becomes a particular case in this approach. It is shown that the model finds optimal solutions for a large percentage of the treated instances and provides a good performance ratio for the rest.

[1] E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines, A Stochastic Approach to Combinational Optimization ond Neural Computing. New York: Wiley, 1989.
[2] D. Ackley, G. Hinton, and T. Segnowski, "A learning algorithm for Boltzmann machines,"Cognitive Sci., vol. 9, pp. 147-169, 1985.
[3] A. Bertoni, P. Campadelli, and F. Grassani, "Full parallelism in Boltzmann machines," inProc. Neuro-Nimes, pp. 361-370, Nimes, Nov. 1989.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[5] J. J. Hopfield and D. W. Tank, "Neural computation of decision in optimization problems,"Biol. Cybern., vol. 52, pp. 141-152, 1985.
[6] D. S. Johnson, "Approximation algorithms for combinatorial problems,"J. Comput. Syst. Sci., vol. 9, pp. 256-278, 1974.
[7] S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, pp. 671-689, 1983.
[8] V. Th. Paschos, "Computational problems of query optimization in database theory," Ph.D. dissertation, Ecole Nationale Polytéchnique d' Athènes, July 1988.
[9] Y. Peng, "A connectionist approach to vertex cover problems," IJCNN, Washington, June 1989.
[10] S. Poljak and M. Sura, "On periodical behaviour in societies with symmetric influences,"Combinatorica, vol. 3, no. 1, pp. 119-121, 1983.
[11] A. Stafylopatis and V. Zissimopoulos, "On discrete nonlinear associative memories," inProc. IV ISCIS,Çesme, Oct. 1989, pp. 625-634.

Index Terms:
approximation; NP-complete problems; Boltzmann machine method; covering; packing problems; maximum independent set; set partitioning; clique; minimum vertex cover; minimum set cover; optimal solutions; combinatorial mathematics; computational complexity; heuristic programming; neural nets; parallel architectures.
Citation:
V. Zissimopoulos, V.T. Paschos, F. Pekergin, "On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems," IEEE Transactions on Computers, vol. 40, no. 12, pp. 1413-1418, Dec. 1991, doi:10.1109/12.106226
Usage of this product signifies your acceptance of the Terms of Use.