76 search results - page 1 / 16 » Counting Solutions of Knapsack Constraints |
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
CPAIOR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
ANOR
2002
13 years 4 months ago
2002
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...