4 search results - page 1 / 1 » Optimally Locating a Structured Facility of a Specified Leng... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
DAM
2000
13 years 4 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...