Incremental assignment problem

被引:26
|
作者
Toroslu, Ismail H. [1 ]
Ucoluk, Gokturk [1 ]
机构
[1] Middle E Tech Univ, Dept Comp Engn, TR-06531 Ankara, Turkey
关键词
assignment problem; weighted bipartite graph; Hungarian algorithm;
D O I
10.1016/j.ins.2006.05.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we introduce the incremental assignment problem. In this problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. We propose an O(vertical bar V vertical bar(2)) algorithm for the problem. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:1523 / 1529
页数:7
相关论文
共 50 条
  • [41] Repulsive Assignment Problem
    M. Gaudioso
    L. Moccia
    M. F. Monaco
    Journal of Optimization Theory and Applications, 2010, 144 : 255 - 273
  • [42] Multicampaign assignment problem
    Kim, YH
    Moon, BR
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2006, 18 (03) : 405 - 414
  • [43] A Stochastic Assignment Problem
    Wu, David T.
    Ross, Sheldon M.
    NAVAL RESEARCH LOGISTICS, 2015, 62 (01) : 23 - 31
  • [44] EIGENSTRUCTURE ASSIGNMENT PROBLEM
    许可康
    黄一
    Chinese Science Bulletin, 1992, (04) : 269 - 273
  • [45] AN APPLICATION OF THE ASSIGNMENT PROBLEM
    MACHOL, RE
    OPERATIONS RESEARCH, 1961, 9 (04) : 585 - 586
  • [46] HARD ASSIGNMENT PROBLEM
    QUEYRANNE, M
    OPERATIONS RESEARCH, 1978, 26 (02) : 376 - 376
  • [47] AN APPLICATION OF ASSIGNMENT PROBLEM
    MACHOL, RE
    OPERATIONS RESEARCH, 1970, 18 (04) : 745 - &
  • [48] The group assignment problem
    Poore, AB
    Gadaleta, S
    SIGNAL AND DATA PROCESSING OF SMALL TARGETS 2003, 2003, 5204 : 595 - 607
  • [49] On a variant of assignment problem
    Dong, JQ
    Li, CQ
    PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 535 - 538
  • [50] On the chairman assignment problem
    Schneider, R
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 217 - 222