Sciweavers

121 search results - page 1 / 25
» An Efficient Parallel Algorithm for Solving the Knapsack Pro...
Sort
View
PDPTA
1996
13 years 6 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
EOR
2006
120views more  EOR 2006»
13 years 4 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
IPL
2006
101views more  IPL 2006»
13 years 4 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
13 years 8 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...