β Scribed by M. V. Abramova
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The crude global search that is used in parameter space investigation provides ag proximations to the set of efficient points. Estimates of approximation errors are established and numerical examples confirm these estimates. The investigated examples can be used as tests for various numerical method
The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith
We study the asymptotic behavior of the minimal cost of computing an \(\varepsilon\)-approximation to linear continuous operators, as \(\varepsilon \rightarrow 0^{+}\). An approximation is computed based on perturbed values of linear and continuous functionals which can be chosen adaptively. Obtaini