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
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.
optimization, local search, polynomial of Boolean variables, facility location problem, set coverage problem.
PDF file (355 kB)
Journal of Applied and Industrial Mathematics, 2012, 6:1, 22–30
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
\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.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. L. Beresnev, “Local search algorithms for the problem of competitive location of enterprises”, Autom. Remote Control, 73:3 (2012), 425–439
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
A. V. Seliverstov, “On monomials in quadratic forms”, J. Appl. Industr. Math., 7:3 (2013), 431–434
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
V. L. Beresnev, “On the competitive facility location problem with a free choice of suppliers”, Autom. Remote Control, 75:4 (2014), 668–676
A. A. Mel'nikov, “Computational complexity of the discrete competitive facility location problem”, J. Appl. Industr. Math., 8:4 (2014), 557–567
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
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
V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, J. Appl. Industr. Math., 10:1 (2016), 61–68
|Number of views:|