Abstract
A conditional linear fully combinatorial minimization problem on permutations is analyzed. The methods of branching, pruning, and estimating in the branch and bound method are proposed for this problem. An illustrative example of applying the method to the problem is presented. The property of the proposed estimation of the admissible subset, which increases the efficiency of branching and pruning, is proved.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call