Minimal cost set covering using probabilistic methods

Proceedings of the ACM Symposium on Applied Computing

Volumn Part F129680, Issue , 1993, Pages 157-164

  Sen, Sandip ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTS COMPUTING; BOOLEAN FUNCTIONS; COMPUTATION THEORY; GENETIC ALGORITHMS; SIMULATED ANNEALING;

ASSOCIATED COSTS; DIGITAL LOGIC DESIGN; LARGE-SIZED; MINIMAL COST; NP COMPLETE; OPTIMAL SOLUTIONS; PROBABILISTIC METHODS; PROBABILISTIC TECHNIQUE;

COSTS;

EID: 0008759125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/162754.162852     Document Type: Conference Paper

References (14)

1. D. H. Ackley, A connectionist machine for genetic hillclimbing. Boston: Kluwer Academic Press, 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. 141146, 1991.
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979.
4. D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning. Reading, Massachusetts: Addison-Wesley, 1989.
5. R. M. Karp, "Reducibility among combinatorial problems", in R. E. Miller and J. W. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, New York, pp. 85-103, 1972.
6. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing", Science, 2010(4598), pp. 671-680, 1983.
7. Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, NY, 1978.
8. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Practice, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1987.
9. J. Lam and J. M. Delosme, "Logic Minimization Using Simulated Annealing", in Proc. IEEE Intl. Conf. on CAD (ICCAD 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, and J. R. C. Holland, "A Study of Permutation Crossover Operators on the Travelling Salesman Problem", in Proceedings of the Second Intl. Conf. on Genetic Algorithms, 224230, Lawrence Erlbaum, Hillsdale, New Jersey, 1987.
12. R. H. J. M. Otten and L. P. P. P. van Ginneken, The Annealing Algorithm. Boston, Massachusetts: Kluwer Academic, 1989.
13. J. T. Richardson, M. R. Palmer, G. E. Liepins, and M. Hilliard, "Some Guidelines for Genetic Algorithms with Penalty Functions", in Proceedings of the Third Intl. Conf. on Genetic Algorithms, 191197, Morgan Kaufmann, San Mateo, California, 1989.
14. J. D. Scharfer, R. A. Caruana, L. J. Eshelman, and R. Das, "A Study of Control Parameters Affecting Online Performance of Genetic Algorithms", in Proceedings of the Third Intl. Conf. on Genetic Algorithms, 51-60, Morgan Kaufmann, San Mateo, California, 1989.