Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Approximation algorithms for NP-hard problems
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Hardness of Approximate Hypergraph Coloring
SIAM Journal on Computing
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence
Genetic Algorithms and Neighbourhood Search
Selected Papers from AISB Workshop on Evolutionary Computing
Multiobjective Metaheuristics for the Bus Driver Scheduling Problem
Transportation Science
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
On complexity of the optimal recombination for the travelling salesman problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
| Hi-index | 0.01 |
We consider the optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The optimal recombination is studied in the case where a vector of binary variables is used as a solution encoding. By means of efficient reductions of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition problem, and for linear Boolean programming problems with at most two variables per inequality, and some other problems. We also identify several NP-hard cases of optimal recombination: the Boolean linear programming problems with three variables per inequality, the knapsack, the set covering, the p-median, and some other problems.