An approach to the construction of approximate solutions of Boolean linear programming problems
From MaRDI portal
Publication:3824101
DOI10.1007/BF01069525zbMath0671.90051OpenAlexW2015637585MaRDI QIDQ3824101
V. P. Shilo, Ivan V. Sergienko
Publication date: 1988
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01069525
polynomial algorithmsBoolean linear programmingasymptotically stable \(\epsilon\)-optimal solutionsoptimal \(\delta\)-allowable solution
Related Items (11)
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms ⋮ Optimal control models for interregional migration under social risks ⋮ Classification of applied methods of combinatorial optimization ⋮ Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms ⋮ Investigation of solutions of randomly generated integer programming problems with 0-1 variables ⋮ Some directions and results of research in mathematical programming and system analysis ⋮ Scenarios of optimal control of transregional migration processes under risk ⋮ Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty ⋮ 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 ⋮ A model of optimal control over a nonlinear multidimensional innovation diffusion process
Cites Work
This page was built for publication: An approach to the construction of approximate solutions of Boolean linear programming problems
