scientific article; zbMATH DE number 3679539

MaRDI QIDQ3875693zbMATH OpenFDO

Authors T. T. Lebedeva, V. A. Roshchin, I. V. Sergienko

Publication date 1980

zbMATH Keywords

surveyknapsack problemnumerical studyboolean programmingbranch and bound methodsparametric integer linear programmingcomparison of algorithmsimplementation 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) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09) Theory of operating systems (68N25)

Cited in

(22)

• An approach to the construction of approximate solutions of Boolean linear programming problems
• Method of solution of extremal combinatorial problems with nonlinear structure
• Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
• Some directions and results of research in mathematical programming and system analysis
• Formalization and solution of a special class of transportation problems
• Stability, parametric, and postoptimality analysis of discrete optimization problems
• Certain parametric problems of integer convex programming and their approximate solution
• Solution of a parametric integer programming problem
• New applications of partial orders
• APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
• scientific article; zbMATH DE number 6152371 (Why is no real title available?)
• Problems of discrete optimization: challenges and main approaches to solve them
• scientific article; zbMATH DE number 5898062 (Why is no real title available?)
• Investigation of optimization methods and their applications
• Fast solution of discretized optimization problems. Workshop held at the Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany, May 8--12, 2000
• Effectiveness of the local algorithm for the solution of one class of discrete programming problems
• Solving partially integer-valued optimization problems which are convex relative to a continuous variable
• scientific article; zbMATH DE number 702579 (Why is no real title available?)
• Mathematical models for arbitrage planning
• Solution of one problem of optimal partition of the vertex set of a hypergraph
• scientific article; zbMATH DE number 5935368 (Why is no real title available?)
• Main directions in the development of informatics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875693)