SCOPUS 정보 검색 플랫폼

Neurocomputing

Volumn 69, Issue 7-9 SPEC. ISS., 2006, Pages 913-916

An efficient simulated annealing algorithm for the minimum vertex cover problem

(2) Xu, Xinshun a Ma, Jun a

a SHANDONG UNIVERSITY (China)

Author keywords

Local minimum; NP complete problem; Simulated annealing; Vertex cover

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; OPTIMIZATION; PROBABILITY;

ANNEALING ALGORITHM; LOCAL MINIMUM; OPTIMAL SOLUTIONS; VERTEX COVER;

ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; COMPUTER; COMPUTER PROGRAM; INTERMETHOD COMPARISON; MATHEMATICAL PARAMETERS; MATHEMATICAL VARIABLE; PRIORITY JOURNAL; PROBABILITY; PROBLEM SOLVING; QUALITY CONTROL; SIMULATION;

EID: 32544436890 PISSN: 09252312 EISSN: None Source Type: Journal
DOI: 10.1016/j.neucom.2005.12.016 Document Type: Article

Times cited : (30)

References (8)

1
- 0029290085
- Fixed parameter tractability and completeness II: Completeness for W[1]
- R.G. Downey M.R. Fellows Fixed parameter tractability and completeness II: Completeness for W[1] Theor. Computer Sci. 141 1-2 1995 109
- (1995) Theor. Computer Sci. , vol.141 , Issue.1-2 , pp. 109
- Downey, R.G.¹ Fellows, M.R.²

2
- 0003603813
- San Francisco: Freeman
- M.R. Garey D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

3
- 0021835689
- Neural computation of decisions in optimization problems
- J.J. Hopfield D.W. Tank Neural computation of decisions in optimization problems Biol. Cybernetics 52 4 1985 141
- (1985) Biol. Cybernetics , vol.52 , Issue.4 , pp. 141
- Hopfield, J.J.¹ Tank, D.W.²

4
- 0003037529
- Reducibility among combinatorial problems
- R.E. Miller J.W. Thatcher Plenum Press New York
- R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thatcher Complexity of Computer Computation 1972 Plenum Press New York 85-103
- (1972) Complexity of Computer Computation , pp. 85-103
- Karp, R.M.¹

5
- 18544385336
- An evolutionary heuristic for the minimum vertex cover problem
- G.I. Bonn (Ed.)
- S. Khuri, T. Back, An evolutionary heuristic for the minimum vertex cover problem, in: G.I. Bonn (Ed.), Proceedings of KI-94 Workshops, the 18th German Annual Conference on Artificial Intelligence, 1994, pp. 83-84.
- (1994) Proceedings of KI-94 Workshops, the 18th German Annual Conference on Artificial Intelligence , pp. 83-84
- Khuri, S.¹ Back, T.²

6
- 84957074014
- Upper bounds for vertex cover further improved
- Springer Lecture Notes in Computer Science Springer
- R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: Proceedings of STACS'99, the 16th Annual Symposium on Theoretical Aspects of Computer Science, Springer Lecture Notes in Computer Science, vol. 1563, Springer, 1999, pp. 561-570.
- (1999) Proceedings of STACS'99, the 16th Annual Symposium on Theoretical Aspects of Computer Science , vol.1563 , pp. 561-570
- Niedermeier, R.¹ Rossmanith, P.²

7
- 0003942663
- Berlin: Springer
- D.T. Pham D. Karaboga Intelligent Optimisation Techniques: Genetic Algorithm, Tabu Search, Simulated Annealing, and Neural Networks 2000 Springer Berlin
- (2000) Intelligent Optimisation Techniques: Genetic Algorithm, Tabu Search, Simulated Annealing, and Neural Networks
- Pham, D.T.¹ Karaboga, D.²

8
- 0002381070
- Neural networks for combinatorial optimization: A review of more than a decade of research
- K.A. Smith Neural networks for combinatorial optimization: A review of more than a decade of research Informs Journal on Computing 11 1 1999 15-34
- (1999) Informs Journal on Computing , vol.11 , Issue.1 , pp. 15-34
- Smith, K.A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.