On an optimal solution for multi-constrained routing problem in the over-constrained case

The problem of multi-constrained routing in wireless ad-hoc networks often becomes over-constrained due to a large number of different constraints requested in such networks. Based on a generalization of the multi-constrained optimal path (MCOP) problem, we propose to find an optimal closest-to-feasible solution in this case. A corresponding problem is formally defined in the paper. Also, an efficient algorithm is proposed for finding such a solution in a special case of concave metrics. The algorithm is based on the Boolean-valued network model. An example to demonstrate the proposed algorithm is presented in the final part of the paper.