Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
This paper is concerned with the problem of image analysis based detection of local defects embedded in particleboard surfaces. Though simple, but efficient technique developed is ...
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
In this work we consider a new class of Relaxation Finite Element schemes for Conservation Laws, with more stable behavior on the limit area of the relaxation parameter. Combine t...