An approach to the construction of approximate solutions of Boolean linear programming problems

DOI10.1007/BF01069525MaRDI QIDQ3824101zbMATH OpenOpenAlexFDO

Authors V. P. Shilo, I. V. Sergienko

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069525

zbMATH Keywords

asymptotically stable \(\epsilon\)-optimal solutionsBoolean linear programmingoptimal \(\delta\)-allowable solutionpolynomial algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 56486
• Publication:3477568
• The stability of the approximate Boolean minimization of a linear form
• scientific article; zbMATH DE number 59500
• Boolean linear programming with interval coefficients

Cited in

(15)

• A model of optimal control over a nonlinear multidimensional innovation diffusion process
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
• Investigation of solutions of randomly generated integer programming problems with 0-1 variables
• Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms
• Some directions and results of research in mathematical programming and system analysis
• Optimal control models for interregional migration under social risks
• Scenarios of optimal control of transregional migration processes under risk
• Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty
• scientific article; zbMATH DE number 3978823 (Why is no real title available?)
• scientific article; zbMATH DE number 56486 (Why is no real title available?)
• scientific article; zbMATH DE number 59500 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Classification of applied methods of combinatorial optimization
• An optimal control model for a system of degenerate parabolic integro-differential equations
• Stability criteria in vector combinatorial bottleneck problems in terms of binary relations

This page was built for publication: An approach to the construction of approximate solutions of Boolean linear programming problems

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