1984 search results - page 71 / 397 » The colourful feasibility problem |
EMO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
COR
2007
13 years 10 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
AIMSA
2004
Springer
14 years 3 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
AAAI
1998
13 years 11 months ago
1998
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...