Optical processor for solving the traveling salesman problem (TSP)

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 6311, Issue , 2006, Pages

  Shaked, Natan T ^a   Simon, Gil ^a   Tabib, Tal ^a   Mesika, Stephane ^a   Dolev, Shlomi ^a   Rosen, Joseph ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

NP complete problems; Optical computing; Optical correlators; Optical data processing

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTER SIMULATION; IMAGE PROCESSING; ITERATIVE METHODS; OPTICAL CORRELATION; OPTICAL DATA PROCESSING; PROBLEM SOLVING; VECTOR QUANTIZATION;

BINARY MATRIX; ITERATIVE ALGORITHMS; NP COMPLETE PROBLEMS; VECTOR DUPLICATIONS;

TRAVELING SALESMAN PROBLEM;

EID: 33750688877     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.683979     Document Type: Conference Paper

References (7)

1. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, W. H. Freeman and Company, New York, 1979.
2. D. Gutfreund, R. Shaltiel, and A. Ta-Shma, "If NP languages are hard on the worst-case then it is easy to find their hard instances," in Proc. of the 20th Annual Conference on Computational Complexity (CCC), San Jose, California 2005. A long version of this paper is available on web in: www.cs.tau.ac.il/~amnon/Papers/GST.cc05.journal.ps
3. N. T. Snaked, S. Messika, S. Dolev, and J. Rosen, "Optical solution for bounded NP-complete problems," Submitted for Publication in Appl. Opt., February 2006.
4. nd edition, pp. 232-243, McGraw-Hill, New York, 1996.
5. J. J. Burch, "Computer algorithm for the synthesis of spatial frequency filters," Proc. IEEE 55, 599-601 (1967).
6. A. VanderLugt, "Signal detection by complex spatial filtering," IEEE Trans. on Inf. Theory IT-10, 139-145 (1964).
7. C. S. Weaver and J. W. Goodman, "A technique for optically convolving two functions," Appl. Opt. 5, 1248-1249 (1966).