1984 search results - page 107 / 397 » The colourful feasibility problem |
CN
2004
13 years 10 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
CPAIOR
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
GI
2007
Springer
14 years 2 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
IPCO
2004
13 years 11 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
WSC
2004
13 years 11 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...