Anomalies in Parallel Branch-and-Bound Algorithms (1984)

Cached

Download Links

by Ten-hwang Lai , Sartaj Sahni
Citations:50 - 3 self

Documents Related by Co-Citation

19 Coping with Anomalies in Parallel Branch-and-Bound Algorithms – Guo-jie Li, Benjamin W Wah - 1986
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
2593 On the theory of dynamic programming – Richard E Bellman - 1952
692 Heuristics: Intelligent Search Strategies for Computer Problem Solving – J Pearl - 1984
19 A hypercube algorithm for the 0/1 knapsack problem – J Lee, E Shragowitz, S Sahni - 1988
12 Adaptive parallel algorithms for integral knapsack problems – S Teng - 1990
12 Experience with Two Parallel Programs Solving the Travelling Salesman Problem – J Mohan - 1983
6 An improved parallel algorithm for 0/1 knapsack problem – G H Chen, J H Jang - 1992
26 Algorithmes et architectures systoliques. Masson – P Quinton, Y Robert - 1989
9 Processor efficient hypercube algorithm for the knapsack problem – J Lin, J Storer - 1991
9 A Hard Knapsack Problem – C-S Chung, M S Hung, W O Rom - 1988
113 Integer programming – R S Garfinkel, G L Nemhauser - 1972
524 Knapsack Problems: Algorithms and Computer Implementations – S Martello, P Toth - 1990
4 Delta transformation to symplify VLSI processor arrays for serial dynamic programming – R J Lipton, D Lopresti - 1986
11 Pipeline architectures for dynamic programming algorithms – G Chen, M Chern, J Jang - 1990
9 Efficient linear systolic array for the knapsack problem – R Andonov, P Quinton
44 Synthesizing systolic arrays from Recurrences Equations with Linear Dependencies – S V Rajopadhye, S Purushothaman, R M Fujimoto - 1986
9 Systolic Processing For Dynamic Programming Problems – Benjamin W. Wah, Guo-jie Li - 1988
72 An algorithm for the traveling salesman problem – D C Little, K G Murty, D W Sweeney, C Karel - 1963