Singly constrained assignment problem: a Lagrangian relaxation heuristic algorithm

被引：0
|
作者：
Kennington, Jeffery L. [1 ]
Mohammadi, Farin [1 ]
机构：
[1] Southern Methodist Univ, Dallas, United States
来源：
Computational Optimization and Applications | 1994年 / 3卷 / 01期
关键词：
Constraint theory - Heuristic programming - Optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This manuscript presents a new heuristic algorithm to find near optimal integer solutions for the singly constrained assignment problem. The method is based on Lagrangian duality theory and involves solving a series of pure assignment problems.
引用
收藏
页码：7 / 26
相关论文
共 50 条
  • [21] Study on relaxation algorithm of assignment problem
    Liu, Qiming
    Bai, Shu-yan
    Zhang, Fu-zeng
    General System and Control System, Vol I, 2007, : 297 - 300
  • [22] A Lagrangian Relaxation based heuristic for the consolidation problem of airfreight forwarders
    Huang, Kuancheng
    Chi, Wenhou
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2007, 15 (04) : 235 - 245
  • [23] An improved Lagrangian relaxation heuristic for the scheduling problem of operating theatres
    Zhou Bing-hai
    Yin Meng
    Lu Zhi-qiang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 : 490 - 503
  • [24] A heuristic for the time constrained asymmetric linear sum assignment problem
    Peter Brown
    Yuedong Yang
    Yaoqi Zhou
    Wayne Pullan
    Journal of Combinatorial Optimization, 2017, 33 : 551 - 566
  • [25] A heuristic for the time constrained asymmetric linear sum assignment problem
    Brown, Peter
    Yang, Yuedong
    Zhou, Yaoqi
    Pullan, Wayne
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 551 - 566
  • [26] A LAGRANGEAN-RELAXATION METHOD FOR THE CONSTRAINED ASSIGNMENT PROBLEM
    AGGARWAL, V
    COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (01) : 97 - 106
  • [27] A NEW LAGRANGIAN-RELAXATION APPROACH TO THE GENERALIZED ASSIGNMENT PROBLEM
    JORNSTEN, K
    NASBERG, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 27 (03) : 313 - 323
  • [28] A LAGRANGIAN-RELAXATION ALGORITHM FOR SPARSE QUADRATIC ASSIGNMENT PROBLEMS
    MILIS, IZ
    MAGIROU, VF
    OPERATIONS RESEARCH LETTERS, 1995, 17 (02) : 69 - 76
  • [29] ANALYSIS OF A HEURISTIC ALGORITHM FOR PLANAR ASSIGNMENT PROBLEM.
    Yamada, Shoichiro
    Harashima, Katsumi
    Kasai, Tamotsu
    Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), 1987, 70 (06): : 1 - 10
  • [30] Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem
    Pan, Yiyong
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
12345