920 search results - page 35 / 184 » Generating Satisfiable Problem Instances |
CPAIOR
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
COR
2010
13 years 10 months ago
2010
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
ESAW
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Many problems studied in the multiagent systems community can be considered instances of an abstract multiagent resource allocation problem. In this problem, which is now...