Dynamic programming on the word RAM

Algorithmica (New York)

Volumn 35, Issue 2, 2003, Pages 128-145

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Binary encoding; Dynamic programming; Knapsack problem; Word RAM

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SET THEORY;

BINARY ENCODING; DIRECTED ACYCLIC GRAPH; KNAPSACK PROBLEM;

DYNAMIC PROGRAMMING;

EID: 0942268488     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0989-y     Document Type: Article

References (21)

1. R. E. Bellman (1957), Dynamic Programming, Princeton University Press, Princeton, NJ.
2. J. E. Bergstrom and D. Pisinger, Karigma Project, Andersen Consulting (2000).
3. V. Chvátal (1980), Hard knapsack problems, Operations Research, 28, 1402-1411.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein (2001) Introduction to Algorithms (second edition), MIT Press, Cambridge, MA.
5. G. B. Dantzig (1957) Discrete variable extremum problems, Operations Research, 5, 266-277.
6. M. Desrochers, J. Desrosiers and M. Solomon (1992), A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, 40, 342-354.
7. K. Dudziński and S. Walukiewicz (1987), Exact methods for the knapsack problem and its generalizations, European Journal of Operational Research, 28, 3-21.
8. P. C. Gilmore and R. E. Gomory (1965), Multi-stage cutting stock problems of two and more dimensions, Operations Research, 13, 94-120.
9. T. Hagerup (1998), Sorting and searching on the word RAM, Proc. 15th Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science 1373, Springer-Verlag, Berlin, pp. 366-398.
10. R. Hassin (1992), Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research, 17, 36-42.
11. D. S. Hirschberg (1975), A linear space algorithm for computing maximal common subsequences, Communications of the ACM, 18, 341-343.
12. T. Ibaraki (1987), Enumerative approaches to combinatorial optimization-Part 2, Annals of Operations Research, 11, 376-388.
13. Intel Pentium 4 Processor Optimization (1999-2000), Reference Manual, Intel Corp (http://developer.intel.com).
14. R. G. Jeroslow (1974), Trivial integer programs unsolvable by branch-and-bound, Mathematical Programming, 6, 105-109.
15. E. L. Lawler (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
16. S. Martello and P. Toth (1990), Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester.
17. U. Pferschy (1999), Dynamic programming revisited: improving knapsack algorithms, Computing, 63, 419-430.
18. D. Pisinger (1997), A minimal algorithm for the 0-1 knapsack problem, Operations Research, 45, 758-767.
19. D. Pisinger (1999), Linear time algorithms for knapsack problems with bounded weights, Journal of Algorithms, 33, 1-14.
20. D. Pisinger (1999), An exact algorithm for large multiple knapsack problems, European Journal of Operational Research, 114, 528-541.
21. D. Pisinger and P. Toth (1998), Knapsack problems, in D.-Z. Du and P. Pardalos (eds.), Handbook of Combinatorial Optimization, Vol. 1, Kluwer, Dordrecht, pp. 299-428.