Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. J. Pure and Appl. Math.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2012, Volume 12, Issue 1, Pages 91–101 (Mi vngu110)  

This article is cited in 1 scientific paper (total in 1 paper)

Local search methods for a column permutation problem for the binary matrix

Yu. A. Kochetova, M. G. Sivykhb, A. V. Khmelevb, A. V. Yakovlevb

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia

Abstract: The iterative local search methods for the column permutation problem for the binary matrix are developed and studied. It is known that the problem is NP-hard in the strong sense, and for the broad class of polynomial time approximation algorithms the relative deviation from the optimum may be arbitrary large in the worst case. In this paper we show that the iterative local search methods can find the global optimum or near optimal solution quickly if the number of columns and the number of rows of the matrix are 100 at most.

Keywords: local search, metaheuristic, data compression.

Full text: PDF file (242 kB)
References: PDF file   HTML file
UDC: 519.21
Received: 18.05.2010

Citation: Yu. A. Kochetov, M. G. Sivykh, A. V. Khmelev, A. V. Yakovlev, “Local search methods for a column permutation problem for the binary matrix”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 12:1 (2012), 91–101

Citation in format AMSBIB
\Bibitem{KocSivKhm12}
\by Yu.~A.~Kochetov, M.~G.~Sivykh, A.~V.~Khmelev, A.~V.~Yakovlev
\paper Local search methods for a~column permutation problem for the binary matrix
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
\yr 2012
\vol 12
\issue 1
\pages 91--101
\mathnet{http://mi.mathnet.ru/vngu110}


Linking options:
  • http://mi.mathnet.ru/eng/vngu110
  • http://mi.mathnet.ru/eng/vngu/v12/i1/p91

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. M. Nedelko, “K voprosu ob effektivnosti bustinga v zadache klassifikatsii”, Vestn. NGU. Ser. matem., mekh., inform., 15:2 (2015), 72–89  mathnet  crossref
  • Вестник Новосибирского государственного университета. Серия: математика, механика, информатика
    Number of views:
    This page:185
    Full text:71
    References:33
    First page:3

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022