29 search results - page 2 / 6 » Exact procedures for solving the discrete ordered median pro... |
NETWORKS
1998
13 years 5 months ago
1998
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
RECOMB
2003
Springer
14 years 5 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
TALG
2010
13 years 1 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...