16404 search results - page 251 / 3281 » A set coverage problem |
121
click to vote
IPCO
2007
15 years 5 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
172
click to vote
AAAI
2011
14 years 4 months ago
2011
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
137
click to vote
HICSS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
145
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
140
click to vote
MOR
2007
15 years 3 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...