2457 search results - page 47 / 492 » Local Search with Bootstrapping |
CP
2005
Springer
15 years 3 months 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...
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
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...
EVOW
2001
Springer
15 years 2 months ago
2001
Springer
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
AIPS
2008
15 years 1 days ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...