RUS  ENG
Full version
PEOPLE
Adelshin Alexander Vladimirovich
Associate professor
Candidate of physico-mathematical sciences (2006)

Speciality: 05.13.01 (System analysis, the control and processing of information (separated by fields))
Birth date: 31.05.1976
E-mail:
Keywords: operations research, integer programming, discrete optimization problems with logical constraints.
UDC: 519.87, 519.8:658.512.22
MSC: 90C05, 90C09, 90C10, 90C27, 90-06

Subject:

Analisys of structure of the optimization problems with logical constraints, development of the algoritms.


Main publications:
  1. Kolokolov A.A., Adelshin A.V., Yagofarova D.I., “Issledovanie i reshenie zadach diskretnoi optimizatsii s logicheskimi ogranicheniyami”, Prikladnaya diskretnaya matematika, 2013, no. 1(19), 99-109  mathnet  elib
  2. Kolokolov A.A., Adelshin A.V., Yagofarova D.I., “Analysis and solving SAT and MAX-SAT problems using an L-partition approach”, Journal of mathematical modelling and algorithms, 12:2 (2013), 10.1007/s10852-012-9202-8 , 12 pp. http://link.springer.com/article/10.1007/s10852-012-9202-8  crossref  mathscinet  zmath  scopus
  3. Adelshin A.V., Kuchin A.K., “Algoritmy tochnogo i priblizhennogo resheniya zadachi maksimalnoi vypolnimosti”, Omskii nauchnyi vestnik, 2011, no. 1, 5-9  elib
  4. Adelshin A.V., Zhovner E.N., “Primenenie zadach vypolnimosti logicheskoi formuly dlya proektirovaniya khimicheskogo sostava rezin”, Vestnik Omskogo universiteta, 2011, no. 2, 14-18  elib
  5. Kolokolov A.A., Adelshin A.V., Yagofarova D.I., “Reshenie zadachi vypolnimosti s ispolzovaniem metoda perebora L-klassov”, Informatsionnye tekhnologii, 2009, no. 2, 54-59  mathscinet  elib
  6. A. V. Adel'shin, “Investigation of maximum and minimum satisfiability problems using $L$-partition”, Autom. Remote Control, 65:3 (2004), 388–395  mathnet  crossref  mathscinet  zmath  isi  scopus
  7. Adelshin A.V., “Zadacha maksimalnoi vypolnimosti i nekotorye algoritmy tselochislennogo programmirovaniya”, Algebra i lineinaya optimizatsiya, Trudy mezhdunarodnogo seminara, posvyaschennogo 90-letiyu so dnya rozhdeniya S. N. Chernikova (Ekaterinburg), UrO RAN, 2002, 235-239  mathscinet
  8. Adel'shin, A. V.; Adel'shina, A. G., “Estimating the number of iterations for dual cutting-plane algorithms.”, Zbl 1075.90540, Vestn. Omsk. Univ., 2000, no. 1, 14-16 (MSC2000: *90C10 65K05 90C27)  zmath

Recent publications

Personal pages:

Organisations:


© Steklov Math. Inst. of RAS, 2024