1182 search results - page 2 / 237 » Iterative Methods in Combinatorial Optimization |
EOR
2002
14 years 9 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
69
Voted
IDA
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
71
Voted
EOR
2006
14 years 9 months ago
2006
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
PR
2010
14 years 4 months ago
2010
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...