Target assignment problem for air raid

被引:0
|
作者
Chudy, M [1 ]
机构
[1] Mil Univ Technol, Fac Cybernet, Warsaw, Poland
来源
CONTROL AND CYBERNETICS | 1999年 / 28卷 / 01期
关键词
air raid planning; assignment problem; branch-and-bound method;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The article deals with two formulations of the target assignment problem. The first one concerns a homogenous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. 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 hetergenous collection of means. To describe this problem a new algebra is introduced.
引用
收藏
页码:101 / 113
页数:13
相关论文
共 50 条
  • [41] Solving the minsum product rate variation problem as an assignment problem
    Natalia Moreno
    Albert Corominas
    International Journal of Flexible Manufacturing Systems, 2006, 18 : 269 - 284
  • [42] Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
    Yedidsion, Liron
    Shabtay, Dvir
    Kaspi, Moshe
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1264 - 1278
  • [43] Modified Balanced Assignment Problem in Vector Case: System Construction Problem
    Kamura, Yuusaku
    Nakamori, Mario
    2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), VOL 2, 2014, : 52 - 56
  • [44] The Stochastic Location-Assignment Problem on a Tree
    Ting Zeng
    James E. Ward
    Annals of Operations Research, 2005, 136 : 81 - 97
  • [45] Fuzzy tabu search for solving the assignment problem
    Li, CG
    Yu, JB
    Liao, XF
    2002 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS AND WEST SINO EXPOSITION PROCEEDINGS, VOLS 1-4, 2002, : 1151 - 1155
  • [46] Group-to-group reviewer assignment problem
    Wang, Fan
    Zhou, Shaorui
    Shi, Ning
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1351 - 1362
  • [47] The stochastic location-assignment problem on a tree
    Zeng, T
    Ward, JE
    ANNALS OF OPERATIONS RESEARCH, 2005, 136 (01) : 81 - 97
  • [48] Approximation Algorithms for the Multiply Constrained Assignment Problem
    Yokoya, Daisuke
    Yamada, Takeo
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 152 - 159
  • [49] Adaptive Genetic Algorithm in the Application of Assignment Problem
    Liu Zeshuang
    Duan Xiaoliang
    PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS A-C, 2008, : 1642 - 1646
  • [50] Algorithmic approaches to the multiple knapsack assignment problem
    Martello, Silvano
    Monaci, Michele
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 90