We consider the vertex cover problem with multiple coverage constraints in hypergraphs. In this problem, we are given a hypergraph \(G=(V,E)\) maximum edge size f, cost function \(w: V\rightarrow {\mathbb {Z}}^+\), and subsets \(P_1,P_2,\ldots ,P_r\) of E along covering requirements \(k_1,k_2,\ldots ,k_r\) for each subset. The objective is to find minimum subset S V such that, \(P_i\), at least...

Deep-learning-based registration methods emerged as a fast alternative to conventional methods. However, these often still cannot achieve the same performance because they are either limited small deformation or fail handle superposition of large and deformations without producing implausible fields with foldings inside. In this paper, we identify important strategies for lung successfully deve...

Due to the favorable performance of structural topology optimization to create a proper understanding in the early stages of design, this issue is taken into consideration from the standpoint of research or industrial application in recent decades. Over the last three decades, several methods have been proposed for topology optimization. One of the methods that has been effectively used in stru...

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

Complete row and column symmetry breaking in constraint models using the lex leader method is generally prohibitively costly. Double lex, which is derived from lex leader, is commonly used in practice as an incomplete symmetrybreaking method for row and column symmetries. Double lex is based on a rowwise canonical variable ordering. However, this choice is arbitrary. We investigate other canoni...