14158 search results - page 378 / 2832 » Generalized switch-setting problems |
115
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
137
click to vote
JGO
2008
15 years 4 months ago
2008
We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under...
134
click to vote
TCS
2008
15 years 4 months ago
2008
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
170
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Recommender systems learn about user preferences over time, automatically finding things of similar interest. This reduces the burden of creating explicit queries. Recommender sys...
133
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...