Prikladnaya Diskretnaya Matematika. Supplement
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



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2019, Issue 12, Pages 218–227
DOI: https://doi.org/10.17223/2226308X/12/61
(Mi pdma476)
 

Computational methods in discrete mathematics

On effectiveness of solving pseudo-Boolean systems of linear inequalities by simulated annealing, Balas algorithm and interior point algorithm

G. O. Manyaev, A. N. Shurupov

ФУМО ВО «Информационная безопасность», г. Москва
References:
Abstract: The aim of this paper is the development and reliability research of the algorithm for solving systems of linear inequalities with Boolean variables, based on variables relaxation, application of the internal point method and the consequent return to Boolean solution. Experimental analysis shows that reliability of the algorithm is about 86 %. This value is higher than the reliability of other heuristic algorithms, applied to the same problem. As the result of experimental research, we have found some classes of systems of inequalities, which are solved by different algorithms with the significantly different reliabilities.
Keywords: pseudo Boolean linear inequalities, interior point method, relaxation, linear programming.
Bibliographic databases:
Document Type: Article
UDC: 512.55
Language: Russian
Citation: G. O. Manyaev, A. N. Shurupov, “On effectiveness of solving pseudo-Boolean systems of linear inequalities by simulated annealing, Balas algorithm and interior point algorithm”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 218–227
Citation in format AMSBIB
\Bibitem{ManShu19}
\by G.~O.~Manyaev, A.~N.~Shurupov
\paper On effectiveness of solving pseudo-Boolean systems of linear inequalities by simulated annealing, Balas algorithm and interior point algorithm
\jour Prikl. Diskr. Mat. Suppl.
\yr 2019
\issue 12
\pages 218--227
\mathnet{http://mi.mathnet.ru/pdma476}
\crossref{https://doi.org/10.17223/2226308X/12/61}
\elib{https://elibrary.ru/item.asp?id=41153939}
Linking options:
  • https://www.mathnet.ru/eng/pdma476
  • https://www.mathnet.ru/eng/pdma/y2019/i12/p218
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:120
    Full-text PDF :44
    References:21
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024