Algorithm for the simplification of solution to discrete optimization problems
Typically, the search for solutions in discrete optimization problems is associated with fundamental computational difficulties. The known methods of accurate or approximated solution of such problems are studied talking into consideration their belonging to so-called problems from P and NP class (a...
Main Authors: | Sergii Chernov, Sergiy Titov, Lyudmila Chernova, Viktor Gogunskii, Liubava Chernova, Kateryna Kolesnikova |
---|---|
Format: | Article |
Language: | English |
Published: |
PC Technology Center
2018-06-01
|
Series: | Eastern-European Journal of Enterprise Technologies |
Subjects: | |
Online Access: | http://journals.uran.ua/eejet/article/view/133405 |
Similar Items
-
Development of a formal algorithm for the formulation of a dual linear optimization problem
by: Lyudmila Chernova, et al.
Published: (2019-08-01) -
Uma aplicação do método da mínima restrição de Gauss
by: G.F. Leal Ferreira -
Trends of Initial Orbit Determination Accuracy for Time Interval Change Between Three Pairs of Measurement Datas
by: Okjun Hwang, et al.
Published: (2009-12-01) -
MPI Parallel Algorithm in Satellite Gravity Field Model Inversion on the Basis of Least Square Method
by: ZHOU Hao, et al.
Published: (2015-08-01) -
The maximum clique problem - on finding an upper bound with application to protein structure alignment
by: Baamann, Katharina
Published: (2009)