76 search results - page 2 / 16 » Counting Solutions of Knapsack Constraints |
173
click to vote
COCOA
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
174
click to vote
MP
2002
15 years 5 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
143
click to vote
CP
2007
Springer
16 years 2 days ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
147
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
174
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...