1182 search results - page 52 / 237 » Iterative Methods in Combinatorial Optimization |
119
click to vote
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
128
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
103
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
122
click to vote
JCC
2006
15 years 1 months ago
2006
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
136
click to vote
IWINAC
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...