9119 search results - page 404 / 1824 » A Simultaneous Search Problem |
179
click to vote
CP
2005
Springer
16 years 10 days ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
162
click to vote
IDA
2003
Springer
16 years 11 hour 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...
182
Voted
EPS
1998
Springer
15 years 11 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
196
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
183
click to vote
PARA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge correspondi...