Search

Issue
Title
Authors
Vol 13, No 4 (2019)
Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints
Romanova A.A., Servakh V.V.
PDF
(Eng)
Vol 13, No 2 (2019)
A Numerical Model of Inflammation Dynamics in the Core of Myocardial Infarction
Voropaeva O.F., Tsgoev C.A.
PDF
(Eng)
Vol 12, No 2 (2018)
An Economical Algorithm for Numerical Solution of the Problem of Identifying the Right-Hand Side of the Poisson Equation
Sorokin S.B.
PDF
(Eng)
Vol 11, No 1 (2017)
Construction of cyclic schedules in presence of parallel machines
Bobrova E.A., Servakh V.V.
PDF
(Eng)
Vol 10, No 1 (2016)
Independent sets in graphs without subtrees with many leaves
Alekseev V.E., Zakharova D.V.
PDF
(Eng)
Vol 13, No 2 (2019)
A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP
Glebov A.N., Toktokhoeva S.G.
PDF
(Eng)
Vol 12, No 2 (2018)
A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
Khutoretskii A.B., Bredikhin S.V., Zamyatin A.A.
PDF
(Eng)
Vol 10, No 4 (2016)
Solving some vector subset problems by Voronoi diagrams
Shenmaier V.V.
PDF
(Eng)
Vol 13, No 1 (2019)
Polyhedral Complementarity on a Simplex: Search for Fixed Points of Decreasing Regular Mappings
Shmyrev V.I.
PDF
(Eng)
Vol 11, No 4 (2017)
An exact algorithm for finding a vector subset with the longest sum
Shenmaier V.V.
PDF
(Eng)
Vol 10, No 4 (2016)
On minimizing dataset transfer time in an acyclic network with four servers
Kononov A.V., Kononova P.A.
PDF
(Eng)
Vol 13, No 1 (2019)
On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies
Gubareva A.V., Panin A.A., Plyasunov A.V., Som L.V.
PDF
(Eng)
Vol 11, No 3 (2017)
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Malyshev D.S., Sirotkin D.V.
PDF
(Eng)
Vol 10, No 3 (2016)
Comparison of models of planning public-private partnership
Lavlinskii S.M., Panin A.A., Plyasunov A.V.
PDF
(Eng)
Vol 13, No 1 (2019)
Estimates of Characteristics of Localization Methods for Discontinuities of the First Kind of a Noisy Function
Ageev A.L., Antonova T.V.
PDF
(Eng)
Vol 11, No 3 (2017)
An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution
Gimadi E.K., Tsidulko O.Y.
PDF
(Eng)
Vol 10, No 3 (2016)
Exact pseudopolynomial algorithms for a balanced 2-clustering problem
Kel’manov A.V., Motkova A.V.
PDF
(Eng)
Vol 12, No 4 (2018)
Approximability of the Problem of Finding a Vector Subset with the Longest Sum
Shenmaier V.V.
PDF
(Eng)
Vol 11, No 1 (2017)
Critical elements in combinatorially closed families of graph classes
Malyshev D.S.
PDF
(Eng)
Vol 10, No 3 (2016)
Graph clustering with a constraint on cluster sizes
Il’ev V.P., Il’eva S.D., Navrotskaya A.A.
PDF
(Eng)
Vol 12, No 3 (2018)
Application of Splitting Algorithms in the Method of Finite Volumes for Numerical Solution of the Navier–Stokes Equations
Kovenya V.M., Babintsev P.V.
PDF
(Eng)
Vol 11, No 1 (2017)
Mathematical models and algorithms for studying strength and stability of shell structures
Karpov V.V., Semenov A.A.
PDF
(Eng)
Vol 10, No 2 (2016)
Numerical solution of an equilibrium problem for an elastic body with a thin delaminated rigid inclusion
Rudoy E.M.
PDF
(Eng)
Vol 13, No 3 (2019)
A Numerical Method of Determining Permittivity from the Modulus of the Electric Intensity Vector of an Electromagnetic Field
Dedok V.A., Karchevsky A.L., Romanov V.G.
PDF
(Eng)
Vol 12, No 2 (2018)
Development and Optimization of Randomized Functional Numerical Methods for Solving the Practically Significant Fredholm Integral Equations of the Second Kind
Voytishek A.V.
PDF
(Eng)
1 - 25 of 27 Items 1 2 > >> 

Search tips:

  • Search terms are case-insensitive
  • Common words are ignored
  • By default only articles containing all terms in the query are returned (i.e., AND is implied)
  • Combine multiple words with OR to find articles containing either term; e.g., education OR research
  • Use parentheses to create more complex queries; e.g., archive ((journal OR conference) NOT theses)
  • Search for an exact phrase by putting it in quotes; e.g., "open access publishing"
  • Exclude a word by prefixing it with - or NOT; e.g. online -politics or online NOT politics
  • Use * in a term as a wildcard to match any sequence of characters; e.g., soci* morality would match documents containing "sociological" or "societal"