Sciweavers

421 search results - page 41 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
DAM
2000
137views more  DAM 2000»
13 years 7 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
RTA
2000
Springer
13 years 11 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
IPPS
2000
IEEE
14 years 2 days ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
4OR
2008
96views more  4OR 2008»
13 years 7 months ago
A column generation approach to train timetabling on a corridor
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Valentina Cacchiani, Alberto Caprara, Paolo Toth