Optical solution for bounded NP-complete problems.

@article{Shaked2007OpticalSF,
  title={Optical solution for bounded NP-complete problems.},
  author={N. Shaked and St{\'e}phane Messika and S. Dolev and Joseph Rosen},
  journal={Applied optics},
  year={2007},
  volume={46 5},
  pages={
          711-24
        }
}
We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scale vector, representing the weights among the TSP cities. The multiplication is performed optically by… Expand
Optical processor for solving the traveling salesman problem (TSP)
TLDR
This paper introduces an optical solution to (bounded-length input instances of) an NP-complete problem called the traveling salesman problem using a pure optical system and shows that this multiplication can be obtained by an optical correlator. Expand
Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems
TLDR
An optical method for synthesizing a binary matrix representing all feasible solutions of a bounded (input length restricted) NP-complete combinatorial problem is presented and an optical matrix-vector multiplier can be used in order to multiply the synthesized binary matrix and a grayscale vector representing the weights of the problem. Expand
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
TLDR
Detailed designs for basic primitives of the optical processor are presented and designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching are proposed. Expand
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
TLDR
This work proposes designs for basic primitives of the optical processor for solving instances of Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, 3D-matching, and the Permanent. Expand
An optical solution for the traveling salesman problem.
TLDR
It will turn out that this number of photons is proportional to N(N) for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. Expand
An Optical Wavelength-Based Solution to the 3-SAT Problem
TLDR
A new optical approach, using wide range of wavelengths exist in a light ray, is provided to solve the 3-SAT problem, a well-known NP-complete problem, in polynomial time. Expand
Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture
TLDR
The results show that the VMM architecture can speedup various variants of the TSP algorithm by a factor of 30x to 50x and time space tradeoffs related to using a record keeping mechanism for storing intermediate solutions are presented. Expand
An Optical Solution for the SAT Problem
TLDR
A delay-based optical device, which has a graph structure which is traversed by light in order to generate a solution, is described for solving the Satisfiability problem. Expand
Light-based solution for the dominating set problem.
TLDR
The provided solution requires polynomial time, exponential length of filters, and exponential number of photons to solve the dominating set problem, and is implemented experimentally using lithographic sheets, on a graph with six vertices. Expand
An optical solution for the set splitting problem
TLDR
An optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem, which has a graph-like structure and the light is traversing it from a start node to a destination node. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
Use of optical hardware to find good solutions to the traveling salesman problem
A systems is described which finds solutions to the 6-city TSP using a Kohonen-type network. The system shows robustness with regard to the light intensity fluctuations and weight discretizationExpand
The traveling salesman: computational solutions for TSP applications
Basic Concepts.- Related Problems and Applications.- Geometric Concepts.- Candidate Sets.- Construction Heuristics.- Improving Solutions.- Heuristics for Large Geometric Problems.- Further HeuristicExpand
Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms
TLDR
This paper provides a substantial proof GAs work for the traveling salesman problem (TSP) and suggests that the performance of probabilisti c search algorithms (such as GAs) is highly dependent on representation and t he choice of neighborhood operators. Expand
Branch-and-Cut Algorithms for Combinatorial Optimization Problems
Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can provide a guarantee of optimality. We describe how a branch-and-cutExpand
Optical Computing: An Introduction
From the Publisher: A source on the rapidly changing field of optical computing. Readers are taken through the relevant concepts of classical and Fourier optics, digital logic and digital imageExpand
Introduction to Fourier optics
The second edition of this respected text considerably expands the original and reflects the tremendous advances made in the discipline since 1968. All material has been thoroughly updated andExpand
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
TLDR
It is shown that there is a fixed distribution on instances of NP-complete languages, that is samplable in quasi-polynomial time and is hard for all probabilistic polynomial-time algorithms (unless NP is easy in the worst case). Expand
Signal detection by complex spatial filtering
  • A. Lugt
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1964
TLDR
The experimental results obtained to date indicate that this technique provides an excellent two-dimensional filtering capability that will play a key role in such problems as shape recognition and signal detection. Expand
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
TLDR
It has been over a decade since neural networks were first applied to solve combinatorial optimization problems and the current standing of neural networks for combinatorsial optimization is presented by considering each of the major classes of combinatorially optimization problems. Expand
The Traveling Salesman
  • G. Reinelt
  • Computer Science
  • Lecture Notes in Computer Science
  • 2001
TLDR
Such that n = |V | and ∑ (u,v)∈C d(u, v) is minimized that the inequality between the values of n and v is minimized. Expand
...
1
2
3
...