154 search results - page 2 / 31 » Approximated Consistency for Knapsack Constraints |
CPAIOR
2008
Springer
13 years 7 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...
MP
2002
13 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...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
ENDM
2010
13 years 3 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...