2474 search results - page 199 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
159
click to vote
TAPIA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
143
click to vote
CATS
2008
15 years 7 months ago
2008
In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative pro...
149
click to vote
ICALP
2005
Springer
15 years 12 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...
139
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
131
click to vote
EOR
2010
15 years 6 months ago
2010
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...