A new hybrid evolutionary algorithm for the MinLA problem

DOI10.1504/IJOR.2009.025009MaRDI QIDQ840588zbMATH OpenOpenAlexFDO

Authors Reeti Sharma, Kamal Srivastava

Publication date 13 September 2009

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2009.025009

zbMATH Keywords

evolutionary algorithmsgraph layoutminimum linear arrangement problem (MinLA)simulated annealing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Contributions to the minimum linear arrangement problem.
• New relationships for multi-neighborhood search for the minimum linear arrangement problem
• Experiments on the minimum linear arrangement problem
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

Cited in

(3)

• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• scientific article; zbMATH DE number 6746785 (Why is no real title available?)
• Population-based iterated greedy algorithm for the S-labeling problem

This page was built for publication: A new hybrid evolutionary algorithm for the MinLA problem

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