Volume 24, No 4, 2017

V. L. Beresnev and A. A. Melnikov
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
P. 5-21

Yu. E. Bessonov and A. A. Dobrynin
Lattice complete graphs
P. 22-33

M. O. Golovachev and A. V. Pyatkin
On ($1, l$)-coloring of incidentors of multigraphs
P. 34-46

A. V. Eremeev
On computational complexity of the electric power flow optimization problem in market environment
P. 47-59

S. S. Marchenkov
On the operations of bounded suffix summation and multiplication
P. 60-76

O. V. Pinyagina
The network equilibrium problem with mixed demand
P. 77-94

R. Yu. Simanchev
On facet-inducing inequalities for combinatorial polytopes
P. 95-110

V. V. Shenmaier
An exact algorithm for finding a vector subset with the longest sum
P. 111-129

 © Sobolev Institute of Mathematics, 2015