RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Melnikov, Andrei Andreevich

Statistics Math-Net.Ru
Total publications: 11
Scientific articles: 11

Number of views:
This page:459
Abstract pages:2470
Full texts:509
References:302
Candidate of physico-mathematical sciences
E-mail: ,

http://www.mathnet.ru/eng/person60195
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2019
1. V. L. Beresnev, A. A. Melnikov, “A bilevel “Attacker–Defender” model to choosing the composition of attack means”, Diskretn. Anal. Issled. Oper., 26:4 (2019),  16–33  mathnet
2. V. L. Beresnev, A. A. Melnikov, “A cut generation algorithm of finding an optimal solution in a market competition”, Diskretn. Anal. Issled. Oper., 26:2 (2019),  5–29  mathnet; J. Appl. Industr. Math., 13:2 (2019), 194–207  scopus
2018
3. V. L. Beresnev, I. A. Davydov, P. A. Kononova, A. A. Melnikov, “Bilevel “defender–attacker” model with multiple attack scenarios”, Diskretn. Anal. Issled. Oper., 25:3 (2018),  5–22  mathnet  elib; J. Appl. Industr. Math., 12:3 (2018), 417–425  scopus
2017
4. I. A. Davydov, A. A. Melnikov, P. A. Kononova, “Local search for load balancing problems for servers with large dimension”, Avtomat. i Telemekh., 2017, 3,  34–50  mathnet  mathscinet  elib; Autom. Remote Control, 78:3 (2017), 412–424  isi  scopus
5. V. L. Beresnev, A. A. Melnikov, “An upper bound for the competitive location and capacity choice problem with multiple demand scenarios”, Diskretn. Anal. Issled. Oper., 24:4 (2017),  5–21  mathnet  elib; J. Appl. Industr. Math., 11:4 (2017), 472–480  scopus
2016
6. V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, Diskretn. Anal. Issled. Oper., 23:1 (2016),  35–50  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:1 (2016), 61–68  scopus
2014
7. A. A. Mel'nikov, “Randomized local search for the discrete competitive facility location problem”, Avtomat. i Telemekh., 2014, 4,  134–152  mathnet; Autom. Remote Control, 75:4 (2014), 700–714  isi  scopus
8. A. A. Mel'nikov, “Computational complexity of the discrete competitive facility location problem”, Diskretn. Anal. Issled. Oper., 21:4 (2014),  62–79  mathnet  mathscinet; J. Appl. Industr. Math., 8:4 (2014), 557–567
9. V. L. Beresnev, A. A. Melnikov, “Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers”, Diskretn. Anal. Issled. Oper., 21:2 (2014),  3–23  mathnet  mathscinet; J. Appl. Industr. Math., 8:2 (2014), 177–189  scopus
2011
10. 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  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 6:1 (2012), 22–30  scopus
2010
11. V. L. Beresnev, A. A. Melnikov, “Approximation algorithms for the competitive facility location problem”, Diskretn. Anal. Issled. Oper., 17:6 (2010),  3–19  mathnet  mathscinet  zmath

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