2181 search results - page 52 / 437 » The restriction scaffold problem |
ENTCS
2008
13 years 8 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
WSC
1998
13 years 10 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
CCE
2006
13 years 8 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...