Primal-target neural net heuristics for the hypergraph k-coloring problem

IEEE International Conference on Neural Networks - Conference Proceedings

Volumn 2, Issue , 1997, Pages 1251-1255

  Kaznachey, D ^a   Jagota, A ^b   Das, S ^c  

^a UNIVERSITY OF MEMPHIS   (United States)

^b University of California Santa Cruz   (United States)

^c UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; CONFLICT-FREE ACCESS; GRAPH OPTIMIZATION PROBLEMS; HIGHER-ORDER STRUCTURE; HOPFIELD NETWORKS; HYPERGRAPH PROBLEM; INEQUALITY CONSTRAINT; K-COLORING PROBLEMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; NEURAL NETWORKS; OPTIMIZATION; HEURISTIC METHODS; PROBLEM SOLVING;

PROBLEM SOLVING; NEURAL NETWORKS;

HYPERGRAPH STRONG COLORING PROBLEM (HC); PRIMAL TARGET NEURAL NET HEURISTICS;

EID: 0030651569     PISSN: 10987576     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNN.1997.616213     Document Type: Conference Paper

References (12)

1. Berge C. Graphs and Hypergraphs. North Holland, New York, 1973.
2. Das K., Sarkar F. & Pinotti M.C. Conflict-Free Access of Trees Parallel Memory Systems and Its Generalization, TR CRPDC-94-21, Dept of Computer Science, University of North Texas, Denton, TX, 1994.
3. Hertz, K., Krogh A., & Palmer R. Introduction to the Theory of Neural Computation. Addison-Wesley, 1991
4. Hopfield J.J. Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc National Academy of Sciences, 79, 1982.
5. Jagota A. Optimization by Reduction to Maximum Clique. International Conference on Neural Networks, 1526-1531, New York, March 1993.
6. Jagota A. & Garzon M. On the mappings of optimization problems to neural networks. World Congress on Neural Networks, 2, 391-398, New York, June 1994. San Diego, IEEE.
7. Jagota A. Optimization by a Hopfield-style Network. Optimality Artificial and Biological Networks, D.S. Levine, W. Elsberry (Eds), Lawrence Erlbaum, 1994. To appear.
8. Jagota A. An adaptive, multiple restarts neural network algorithm for graph coloring. European Journal of Operations Research, page to appear, 1996.
9. Kaznachey D. & Jagota A. Approximating Minimum Set Cover a Hopfield-style Network, Proc of Second Joint Conference on Information Sciences, 358-361, Wrightsville Beach, NC, 1995. Expanded version to appear full conference proceedings.
10. Kaznachey D. & Jagota A. An Improved Neural Net Algorithm for the Hypergraph Vertex Cover Problem. Proc of International Conference on Neural Information Processing, Hong Kong, 1996.
11. Korst J.H.M & Aarts E.H.L. Combinatorial optimization on a Boltzmann machine. Journal of Parallel and Distributed Computing, 6:331-357, 1989.
12. Papadimitriou C.H. & Steiglitz K. Combinatorial optimization: Algorithms and Complexity, Prentice-Hall, 1982.