Methods of local search for a problem on the permutation of the columns of a binary matrix

zbMATH Open1249.90335MaRDI QIDQ2895861FDOQ2895861

Authors: Yury Kochetov, M. S. Sivykh, A. V. Khmelev, A. V. Yakovlev 

Publication date: 13 July 2012

Published in: Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Recommendations

• Iterated local search for consecutive block minimization
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Polynomial-time local-improvement algorithm for consecutive block minimization
• Optimal search for locally feasible solutions of a linear function on permutations
• On the quality of local search for the quadratic assignment problem

zbMATH Keywords

metaheuristicslocal searchcompression of information

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40)

Cited In (3)

• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Iterated local search for consecutive block minimization
• Methods of local optimization for the problem of permutating bipartite graphs

This page was built for publication: Methods of local search for a problem on the permutation of the columns of a binary matrix

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