1182 search results - page 96 / 237 » Iterative Methods in Combinatorial Optimization |
131
Voted
PPL
2010
14 years 10 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
130
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
144
click to vote
IPMI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
134
click to vote
CEC
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
109
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...