A genetic hillclimbing algorithm for the optimal linear arrangement problem

MaRDI QIDQ5472902zbMATH OpenFDO

Authors Timo Poranen

Publication date 19 June 2006

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Experiments on the minimum linear arrangement problem
• scientific article; zbMATH DE number 4043771
• On optimal linear arrangements of trees
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

Cited in

(4)

• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• scientific article; zbMATH DE number 5951329 (Why is no real title available?)
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Molecular solution to the optimal linear arrangement problem based on DNA computation

This page was built for publication: A genetic hillclimbing algorithm for the optimal linear arrangement problem

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