David Pisinger  Home/Search
Context
Related
Links: DBLP | diku.dk/users/pisinger/007.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/users/pisinger/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dynamic programming is one of the fundamental techniques for solving optimization problems. In the present paper we propose a general framework which can be used to decrease the time and space complexity of these algorithms with a logarithmic factor. The framework is based on word encoding, i.e. by representing subsolutions as bits in an integer. In this way word parallelism can be used in the evaluation of the dynamic programming recursion. Using this encoding the subset-sum problem can be... (Update)
Active bibliography (related documents): More All
0.5: An O(nr) algorithm for the Subset-sum Problem - and other.. - Pisinger (Correct)
0.5: A Toolbox for Solving Knapsack Problems - David Pisinger Diku (2003) (Correct)
0.3: Dynamic Programming Parallel Implementations for the Knapsack.. - Andonov, al. (1993) (Correct)
Similar documents based on text: More All
0.4: Optimal External Memory Interval Management - Arge, Vitter (2002) (Correct)
0.4: Contracting the Network During Maximum Generalised Network Flow.. - Radzik (2001) (Correct)
0.4: Optimal Dynamic Interval Management in External Memory - Lars Arge, Jeffrey Scott.. (1996) (Correct)
BibTeX entry: (Update)
@misc{ pisinger-dynamic,
author = "David Pisinger",
title = "Dynamic programming on the word {RAM}",
url = "citeseer.ist.psu.edu/550102.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1989 ACM
234 Dynamic programming (context) - Bellman - 1957 ACM
229 Knapsack Problems: Algorithms and Computer Implementations (context) - Martello, Toth - 1990 ACM
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
81 Knapsack Problems (context) - Pisinger, Toth - 1998
61 Approximation schemes for the restricted shortest path probl.. (context) - Hassin - 1992 ACM
45 A New Optimization Algorithm for the Vehicle Routing Problem.. (context) - Desrochers, Desrosiers et al. - 1992 ACM
31 Enumerative Approaches to Combinatorial Optimization { Part (context) - Ibaraki - 1987
25 Discrete Variable Extremum Problems (context) - Dantzig - 1957
24 Multi-stage cutting stock problems of two and more dimension.. (context) - Gilmore, Gomory - 1965
10 Reference Manual (context) - Pentium, Optimization
10 Discrete dynamic programming and capital allocation (context) - Nemhauser, Ullmann - 1969
7 Hard Knapsack Problems (context) - Chv - 1980
7 A minimal algorithm for the 0-1 knapsack problem - Pisinger - 1997
4 An exact algorithm for large multiple knapsack problems - Pisinger - 1999
3 Trivial Integer Programs Unsolvable by Branch-and-Bound (context) - Jeroslow - 1974
2 Linear time algorithms for knapsack problems with bounded we.. (context) - Pisinger - 1999 ACM DBLP
1 Exact Methods for the Knapsack Problem and its Generalizatio.. (context) - Dudzi, Walukiewicz - 1987
1 Dynamic programming revisited: Improving knapsack algorithms (context) - Pferschy - 1999 DBLP
1 Karigma Project (context) - Consulting - 2000
Documents on the same site (http://www.diku.dk/users/pisinger/): More
An expanding-core algorithm for the exact 0-1 Knapsack Problem. - Pisinger (1993) (Correct)
Discrete Location Problems With Push-Pull Objectives - Krarup, Pisinger, Plastria (1999) (Correct)
An Exact Algorithm for Large Multiple Knapsack Problems - Pisinger (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC