Name
Title | ||
|---|---|---|
Parallel decomposition of combinatorial optimization problems using electro-optical vector by matrix multiplication architecture |
Abstract | ||
|---|---|---|
A new state space representation for a class of combinatorial optimization problems, related to minimal Hamiltonian cycles, enables efficient implementation of exhaustive search for the minimal cycle in optimization problems with a relatively small number of vertices and heuristic search for problems with large number of vertices. This paper surveys structures for representing Hamiltonian cycles, the use of these structures in heuristic optimization techniques, and efficient mapping of these structures along with respective operators to a newly proposed electrooptical vector by matrix multiplication (VMM) architecture. Record keeping mechanisms are used to improve solution quality and execution time of these heuristics using the VMM. Finally, the utility of a low-power VMM based implementation is evaluated. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11227-010-0517-9 | The Journal of Supercomputing |
Keywords | Field | DocType |
Optical super computing,Parallel processing,Combinatorial optimization,Hamiltonian cycles,The traveling salesman problem,Heuristic search | Heuristic,Brute-force search,Computer science,Parallel computing,State-space representation,Combinatorial optimization,Heuristics,Travelling salesman problem,Matrix multiplication,Optimization problem,Distributed computing | Journal |
Volume | Issue | ISSN |
62 | 2 | 0920-8542 |
Citations | PageRank | References |
2 | 0.40 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan E. Tamir | 1 | 79 | 13.26 |
| Natan T. Shaked | 2 | 6 | 1.87 |
| Wilhelmus J. Geerts | 3 | 5 | 1.50 |
| Shlomi Dolev | 4 | 2962 | 260.61 |