| Article ID: | iaor20013424 |
| Country: | Poland |
| Volume: | 28 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 114 |
| Publication Date: | Jan 1999 |
| Journal: | Control and Cybernetics |
| Authors: | Chudy Marian |
| Keywords: | programming: branch and bound |
Two formulations of the target assignment problem are considered. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). A method for solving a subclass of the problem is proposed. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogeneous collection of means. To describe this problem a new algebra is introduced.