Minimal cost set covering using probabilistic methods

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimal cost set covering using probabilistic methods

Full text

Pdf (720 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice table of contents

Indianapolis, Indiana, United States

Pages: 157 - 164

Year of Publication: 1993

ISBN:0-89791-567-4

Author

Sandip Sen

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 30, Citation Count: 5

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/162754.162852 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	David H. Ackley, A connectionist machine for genetic hillclimbing, Kluwer Academic Publishers, Norwell, MA, 1987
	2	P.P. Chu, "Using a Semi-Asynchronous Hopfield Network to Obtain Optimal Coverage in Logic Minimization,' in Proc. Intl. Joint Conf. on Neural Networks, IEEE Press, New York, NY, pp. 141- 146, 1991.
	3	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	4	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	5	R. M. Karp, "Reducibility among combinatorial problems," in R.E. Miller and J.W. Thatcher (eds.) Complezity of Compmier Computations, Plenum Press, New York, pp. 85-103, 1972.
	6	S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, "Optimization by simulated annealing," Science, ~0(4598), pp. 671-680, 1983.
	7	Z. Koh&vi, Switching and Finite Automata Theory, McGraw-Hill, New York, NY, 1978.
	8	P. J. M. Laarhoven , E. H. L. Aarts, Simulated annealing: theory and applications, Kluwer Academic Publishers, Norwell, MA, 1987
	9	J. Lam and J.M. Delosme, "Logic Minimization Using Simulated Annealing,~ in Proc. IEEE Intl. Conf. on CAD (ICCA D 86), 348-351, Santa Clara, California, 1986.
	10	E.J. McCluskey, Logic Design Principles, Prentice- Hall, Engelwood Cliffs, NJ, 1986.
	11	I. M. Oliver , D. J. Smith , J. R. C. Holland, A study of permutation crossover operators on the traveling salesman problem, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, p.224-230, October 1987, Cambridge, Massachusetts, United States
	12	R. H. J. M. Otten , L. P. P. P. van Ginneken, The annealing algorithm, Kluwer, B.V., Deventer, The Netherlands, 1989
	13	Jon T. Richardson , Mark R. Palmer , Gunar E. Liepins , Mike Hilliard, Some guidelines for genetic algorithms with penalty functions, Proceedings of the third international conference on Genetic algorithms, p.191-197, December 1989, George Mason University, United States
	14	J. David Schaffer , Richard A. Caruana , Larry J. Eshelman , Rajarshi Das, A study of control parameters affecting online performance of genetic algorithms for function optimization, Proceedings of the third international conference on Genetic algorithms, p.51-60, December 1989, George Mason University, United States

CITED BY 5

	Mauricio Solar , Víctor Parada , Rodrigo Urrutia, A parallel genetic algorithm to solve the set-covering problem, Computers and Operations Research, v.29 n.9, p.1221-1235, August 2002
	Siqing Du , James B. D. Joshi, Supporting authorization query and inter-domain role mapping in presence of hybrid role hierarchy, Proceedings of the eleventh ACM symposium on Access control models and technologies, June 07-09, 2006, Lake Tahoe, California, USA
	Janusz Kacprzyk , Grażyna Szkatuła, An integer programming approach to inductive learning using genetic and greedy algorithms, New learning paradigms in soft computing, Physica-Verlag GmbH, Heidelberg, Germany, 2002
	Walid Ibrahim, A Novel EDA Tool for VLSI Test Vectors Management, Journal of Electronic Testing: Theory and Applications, v.23 n.5, p.421-434, October 2007
	William R. Scott, Model-based view planning, Machine Vision and Applications, v.20 n.1, p.47-69, October 2008