1. (100%) An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem - Yanasse,Horacio Hideki; Soma,Nei Yoshihiro; Maculan,Nelson
In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of the one dimensional knapsack problem. If n is the total number of different items and b is the knapsack's
(text/html) - 23-may-2005

2. (100%) Abstract - Peter Jacko; José Niño-mora
NOTICE: This is the author’s version of the work that was accepted for publication in Electronic Not ...
(application/pdf) - 14-jul-2009

3. (100%) On Profit Density Based Greedy Algorithm for a Resource Allocation Problem in Web Services - John Sum; Jie Wu; Chi-sing Leung
Allocating limited computational resources to different clients is always a challenging problem to a web service provider (WSP). Profit density based greedy knapsack algorithm is one simple approach
(application/pdf) - 16-jul-2009

4. (100%)
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions*
(application/postscript) - 21-jul-2009

5. (100%) Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximation - Martin Henk; Martin Henk; Robert Weismantel; Robert Weismantel
This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral
(application/postscript) - 24-jul-2009

6. (100%) Contributions to General Mixed Integer Knapsack Problems - Alexander Martin; Robert Weismantel
This paper deals with a general mixed integer knapsack polyhedron for which we introduce and analyze a new family of inequalities. We discuss the value of this family both from a theoretic and
(application/postscript) - 24-jul-2009

7. (100%) Threshold Arrangements and the Knapsack Problem - Günter Rote; André Schulz
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2002) is related to threshold graphs, threshold
(application/pdf) - 26-ago-2009

8. (100%) Threshold Arrangements and the Knapsack Problem - Günter Rote; André Schulz
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2002) is related to threshold graphs, threshold
(application/postscript) - 27-ago-2009

9. (100%) \Lambda
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case comp ...
(application/postscript) - 02-sep-2009

10. (100%) Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem - Heuristic Bias; Günther R. Raidl; Jens Gottlieb; Günther R. Raidl; Jens Gottlieb; G. R. Raidl; J. Gottlieb
Five different representations and associated variation operators are studied in the context of a steady-state evolutionary algorithm (EA) for the multidimensional knapsack problem. Four of them are
(application/pdf) - 22-sep-2009

Página de resultados:
1  2  3  4  5  6  7  8  9  10  Siguiente