832 search results - page 90 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
SIAMSC
2010
14 years 8 months ago
2010
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their fe...
PPSN
1992
Springer
15 years 1 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
GRID
2007
Springer
14 years 9 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...