scientific article

zbMath0435.90064MaRDI QIDQ3875693

T. T. Lebedeva, V. A. Roshchin, Ivan V. Sergienko

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyknapsack problemcomparison of algorithmsnumerical studyboolean programmingbranch and bound methodsparametric integer linear programmingimplementation of algorithmsprogram systemscomputer organizationblock-diagonal matricessoftware organizationfall-vector methodintegral programmingaccelerated additive algorithmChervak's method of small treesdirecting neighbourhoods methodlocal-stochastic algorithmsmanaged random searchpractical data processing problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09) Data structures (68P05) Theory of operating systems (68N25)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them, New applications of partial orders, Certain parametric problems of integer convex programming and their approximate solution, Some directions and results of research in mathematical programming and system analysis, Solution of one problem of optimal partition of the vertex set of a hypergraph, Stability, parametric, and postoptimality analysis of discrete optimization problems, Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements, Effectiveness of the local algorithm for the solution of one class of discrete programming problems, An approach to the construction of approximate solutions of Boolean linear programming problems, Method of solution of extremal combinatorial problems with nonlinear structure, Formalization and solution of a special class of transportation problems, Main directions in the development of informatics, Mathematical models for arbitrage planning, Solution of a parametric integer programming problem, Solving partially integer-valued optimization problems which are convex relative to a continuous variable, Investigation of optimization methods and their applications