RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2011, Volume 18, Number 4, Pages 3–16 (Mi da657)  

This article is cited in 9 scientific papers (total in 9 papers)

Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions

V. L. Beresnevab, E. N. Goncharovab, A. A. Mel'nikovb

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia

Abstract: We consider an algorithm for local search with generalized neighborhood for a pseudo-Boolean function optimization problem. A generalized neighborhood is constructed for locally optimal solutions that contains other locally optimal solutions which surround the former. We bring results of numerical experiments with usage of pseudo-Boolean functions whose optimization is equivalent to problems of facility location, set coverage, and competitive facility location. The aim of experiments is comparative estimating of locally optimal solutions obtained with the common local search algorithm and the algorithm of local search with generalized neighborhood. Tabl. 6, bibliogr. 11.

Keywords: optimization, local search, polynomial of Boolean variables, facility location problem, set coverage problem.

Full text: PDF file (355 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2012, 6:1, 22–30

Bibliographic databases:

UDC: 519.8
Received: 04.04.2011

Citation: V. L. Beresnev, E. N. Goncharov, A. A. Mel'nikov, “Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 3–16; J. Appl. Industr. Math., 6:1 (2012), 22–30

Citation in format AMSBIB
\Bibitem{BerGonMel11}
\by V.~L.~Beresnev, E.~N.~Goncharov, A.~A.~Mel'nikov
\paper Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 4
\pages 3--16
\mathnet{http://mi.mathnet.ru/da657}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2894338}
\zmath{https://zbmath.org/?q=an:1249.90137}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 1
\pages 22--30
\crossref{https://doi.org/10.1134/S1990478912010048}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84857679640}


Linking options:
  • http://mi.mathnet.ru/eng/da657
  • http://mi.mathnet.ru/eng/da/v18/i4/p3

    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. L. Beresnev, “Local search algorithms for the problem of competitive location of enterprises”, Autom. Remote Control, 73:3 (2012), 425–439  mathnet  crossref  isi
    2. K. Yu. Gorbunov, A. V. Seliverstov, V. A. Lyubetsky, “Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube”, Problems Inform. Transmission, 48:2 (2012), 185–192  mathnet  crossref  isi
    3. A. V. Seliverstov, “On monomials in quadratic forms”, J. Appl. Industr. Math., 7:3 (2013), 431–434  mathnet  crossref  mathscinet
    4. V. L. Beresnev, A. A. Melnikov, “Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers”, J. Appl. Industr. Math., 8:2 (2014), 177–189  mathnet  crossref  mathscinet
    5. V. L. Beresnev, “On the competitive facility location problem with a free choice of suppliers”, Autom. Remote Control, 75:4 (2014), 668–676  mathnet  crossref  isi
    6. A. A. Mel'nikov, “Computational complexity of the discrete competitive facility location problem”, J. Appl. Industr. Math., 8:4 (2014), 557–567  mathnet  crossref  mathscinet
    7. I. A. Davydov, P. A. Kononova, Yu. A. Kochetov, “Local search with exponential neighborhood for the servers load balancing problem”, J. Appl. Industr. Math., 9:1 (2015), 27–35  mathnet  crossref  mathscinet
    8. S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “A bilevel planning model for public-private partnership”, Autom. Remote Control, 76:11 (2015), 1976–1987  mathnet  crossref  isi  elib  elib
    9. V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, J. Appl. Industr. Math., 10:1 (2016), 61–68  mathnet  crossref  crossref  mathscinet  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:415
    Full text:95
    References:34
    First page:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020