A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM

被引：171
|
作者：
BERTSEKAS, DP
机构：
来源：
MATHEMATICAL PROGRAMMING | 1981年 / 21卷 / 02期
关键词：
Compendex;
D O I：
10.1007/BF01584237
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
MATHEMATICAL PROGRAMMING, LINEAR
引用
收藏
页码：152 / 171
页数：20
相关论文
共 50 条
  • [41] A Memetic Algorithm for the Multidimensional Assignment Problem
    Gutin, Gregory
    Karapetyan, Daniel
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2009, 5752 : 125 - 129
  • [42] A cutting algorithm for the quadratic assignment problem
    Blanchard, A
    Elloumi, S
    Faye, A
    Wicker, N
    INFOR, 2003, 41 (01) : 35 - 49
  • [43] A LABELING ALGORITHM TO SOLVE THE ASSIGNMENT PROBLEM
    LOTFI, V
    COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (05) : 397 - 408
  • [44] Genetic algorithm for the generalised assignment problem
    Imperial Coll, London, United Kingdom
    Comput Oper Res, 1 (17-23):
  • [45] Algorithm for equilibrium transit assignment problem
    Babazadeh, A
    Aashtiani, HZ
    NETWORK MODELING 2005, 2005, (1923): : 227 - 235
  • [46] A genetic algorithm for the channel assignment problem
    Smith, KA
    GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6: THE BRIDGE TO GLOBAL INTEGRATION, 1998, : 2013 - 2018
  • [47] AN ALGORITHM FOR A CONTINUOUS VERSION OF THE ASSIGNMENT PROBLEM
    ANDERSON, EJ
    PHILPOTT, AB
    LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1983, 215 : 108 - 117
  • [48] AN ALGORITHM FOR THE MULTIINPUT EIGENVALUE ASSIGNMENT PROBLEM
    ARNOLD, M
    DATTA, BN
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (10) : 1149 - 1152
  • [49] An algorithm for the generalized quadratic assignment problem
    Peter M. Hahn
    Bum-Jin Kim
    Monique Guignard
    J. MacGregor Smith
    Yi-Rong Zhu
    Computational Optimization and Applications, 2008, 40
  • [50] AN ALGORITHM FOR THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM
    MAZZOLA, JB
    NEEBE, AW
    COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (04) : 355 - 362
12345