The theory of elementary landscapes

Applied Mathematics Letters

Volumn 16, Issue 3, 2003, Pages 337-343

  Barnes, J W ^a   Dimova, B ^a   Dokov, S P ^a   Solomon, A ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Elementary landscape; Graph Laplacian; Grover's equation

Indexed keywords

EID: 84867939960     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(03)80054-X     Document Type: Article

References (11)

1. P.F. Stadler Landscapes and their correlation functions J. Math. Chem. 20 1996 1 45
2. L.K. Grover Local search and the local structure of NP-complete problems Oper. Res. Lett. 12 1992 235 243
3. B. Codenotti, and L. Margara Local properties of some NP-complete problems TR-92-021 1992 International Computer Science Institute, University of California at Berkeley
4. J.W. Barnes, and B. Colletti Local search structure in the symmetric traveling salesman problem under a general class of rearrangement neighborhoods Appl. Math. Lett. 14 1 2001 105 108
5. A. Solomon, J.W. Barnes, S.P. Dokov and R. Acevedo, Weakly symmetric graphs, elementary landscapes and the TSP, Appl. Math. Lett. (to appear).
6. F.R.K. Chung Spectral Graph Theory Volume 92 of CBMS 1997 American Mathematical Society Providence, RI
7. W.J. Stewart Introduction to the Numerical Solution of Markov Chains 1994 Princeton University Princeton, NJ
8. D.M. Cvetkocvic, M. Doob, and H. Sachs Spectra of Graphs 1980 Academic
9. P. Lancaster, and M. Tismenetsky The Theory of Matrices 1985 Academic Press San Diego, CA
10. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Norwell, MA
11. W.B. Carlton, and J.W. Barnes Solving the traveling salesman problem with time windows using tabu search Institute of Industrial Engineering Transactions 28 1996 617 629