62 search results - page 2 / 13 » A new algorithm for normal dominance constraints |
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
ICTAI
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be domina...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper, we propose a new constraint-handling technique for evolutionary algorithms which is based on multiobjective optimization concepts. The approach uses Pareto...