The heuristic algorithms of boundary points search for an constraint pseudo-Boolean optimization problem

Application of the boundary point search scheme for solving an pseudo-Boolean optimization problem with variable constraints is investigated. We consider some heuristic algorithms based on that scheme. Comparison of algorithm efficiency with each other and an universal search algorithm is made for an appropriate real-world problem with large dimension.