The complexity of the optimal recombination for the traveling salesman problem

MaRDI QIDQ3115247zbMATH OpenFDO

Authors Anton Valentinovich Eremeev

Publication date 20 February 2012

zbMATH Keywords

computational complexitygenetic algorithmtraveling salesman problemproblem transformationoptimal recombination

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• On complexity of optimal recombination for one scheduling problem with setup times
• On complexity of optimal recombination for flowshop scheduling problems
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• scientific article; zbMATH DE number 3926663

Cited in

(5)

• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
• On complexity of optimal recombination for one scheduling problem with setup times
• On complexity of optimal recombination for flowshop scheduling problems

This page was built for publication: The complexity of the optimal recombination for the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115247)