16404 search results - page 357 / 3281 » A set coverage problem |
144
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
117
Voted
EWCBR
2004
Springer
2004
Springer
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
15 years 10 months ago
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
147
Voted
EOR
2010
15 years 5 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
144
Voted
EOR
2007
15 years 5 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with pro...
199
click to vote
CPAIOR
2011
Springer
14 years 8 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...