804 search results - page 44 / 161 » Solutions to Computational Problems Through Gene Assembly |
156
click to vote
AE
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
178
click to vote
MP
2006
15 years 6 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
160
click to vote
ATAL
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We present a fast and effective bidding strategy for the Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM, manufacturers compete to procure com...
147
click to vote
CEC
2007
IEEE
16 years 11 days ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
160
click to vote
COR
2006
15 years 6 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...