311 search results - page 15 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
CPAIOR
2009
Springer
14 years 3 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...
IOR
2007
13 years 8 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
EOR
2011
13 years 3 months ago
2011
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
UAI
2004
13 years 10 months ago
2004
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...