315 search results - page 3 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
WSC
2004
13 years 7 months ago
2004
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
ICPADS
2007
IEEE
13 years 12 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...