287 search results - page 3 / 58 » A Tree Search Algorithm for Solving the Container Loading Pr... |
120
click to vote
EUROCAST
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
110
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called
189
click to vote
NETWORKS
2010
15 years 17 days ago
2010
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
138
click to vote
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
137
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...