Issue No. 09 - September (1980 vol. 29)
O.I. El-Dessouki , Illinois Institute of Technology
Known solutions of a large number of important (and difficult) computational problems called NP-complete problems depend on enumeration techniques which examine all feasible alternatives. This paper considers the design of enumeration schemes in a distributed environment in an attempt to exploit the parallel activities inherent in enumeration algorithms.
NP-complete problems, Analysis of distributed algorithms, branch and bound, distributed algorithms, distributed enumeration algorithms, dynamic programming and integer programming, network computers
O. El-Dessouki and W. Huen, "Distributed Enumeration on Between Computers," in IEEE Transactions on Computers, vol. 29, no. , pp. 818-825, 1980.