The knapsack sharing problem: An exact algorithm

Journal of Combinatorial Optimization

Volumn 6, Issue 1, 2002, Pages 35-54

  Hifi, Mhand ^a,b   Sadfi, Slim ^a,c  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b UNIVERSITY OF VERSAILLES   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Combinatorial optimization; Dynamic programming; Knapsack sharing; Sequential algorithms

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL OPTIMIZATION; KNAPSACK SHARING PROBLEM; SEQUENTIAL ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 0036498101     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013385216761     Document Type: Article

References (24)

1. Dynamic programming parallel implementation for the knapsack problem
2. Optimal orthogonal tiling of 2-D iterations
3. The knapsack sharing
4. Solving knapsack sharing with general tradeoff functions
5. Pipeline architectures for dynamic programming algorithms
6. An improved parallel algorithm for 0/1 knapsack problem
7. A genetic algorithm for the multidimensional knapsack problem
8. Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms
9. The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
10. The theory and computation of knapsack functions
11. Cutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections
12. A recursive exact algorithm for weighted two-dimensional cutting
13. Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates
14. A linear-time algorithm for solving continuous maximum knapsack problems
15. BOB: A unified platform for implementing branch-and-bound like algorithms
16. Minmax resource allocation problems: Optimization and parametric analysis
17. Upper bounds and algorithms for hard 0-1 knapsack problems
18. Performance of two heuristics for solving large scale two-dimensional guillotine cutting problems
19. A min-max resource allocation problem with substitutions
20. A max-min allocation problem: Its solutions and applications
21. An LP-based approach to a two-stage cutting stock problem
22. Heuristic and reduction algorithms for the knapsack sharing problem