664 search results - page 24 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
156
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
148
click to vote
SIAMSC
2010
15 years 4 months ago
2010
Abstract. We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appro...
165
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
167
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
152
click to vote
PLDI
2010
ACM
16 years 3 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...