Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

Abstract

Branching rules and the estimation of admissible subsets are proposed for minimization problems on the set of arrangements with a constant sum of the linear objective function for the branch and bound method. Two properties of the estimates are proved. These properties allow reducing the number of the admissible subsets being analyzed.