ISSN 2664 - 2085
Informatics and Control Problems
published by Institute of Control Systems
HOME PAGE
AIMS & SCOPE
EDITORIAL BOARD
AUTHOR GUIDELINES
PUBLICATION ETHICS
STATUS
VOLUMES
CONTACT
Search
Innovative approximate solution methods and error estimation for the knapsack problem
Theoretical substantiation and experimental analysis of the method for finding the upper bound for the interval problem of mixed-Boolean programming
Construction of a guaranteed suboptimal solution to an integer programming problem with one constraint according to the coefficients of the constraint condition
Methods for finding suboptimistic and subpessimistic solutions to interval part of the integer programming problem
Methods for constructing subpessimistic and suboptimistic solution in the Boolean programming problem with interval data
Methods for selecting unknowns in twos for constructing a suboptimal solution to integer programming problems
On one method for constructing subpessimistic and suboptimistic solutions in an integer programming with interval data
Method of nonlinear penalty and estimation of error in constructing suboptimistic and subpessimistic solutions for integer programming problems with interval data
Methods of approximate solution of mixed-Boolean programming problems with interval data