376 search results - page 23 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
EOR
2002
13 years 7 months ago
2002
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
CLOUDCOM
2010
Springer
13 years 5 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
DATESO
2007
13 years 9 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...