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 条
  • [1] Singly constrained assignment problem: an AP basis algorithm
    Kennington, Jeffery L.
    Mohammadi, Farin
    Computational Optimization and Applications, 1995, 4 (04) : 347 - 374
  • [2] A branch-and-bound algorithm for the singly constrained assignment problem
    Lieshout, P. M. D.
    Volgenant, A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) : 151 - 164
  • [3] A Lagrangian Relaxation based Heuristic Approach for Steel Grade Assignment Problem
    Zheng, Yongyue
    Tang, Lixin
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 2645 - 2650
  • [4] A heuristic algorithm based on Lagrangian relaxation for the closest string problem
    Tanaka, Shunji
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 709 - 717
  • [5] A heuristic algorithm based on Lagrangian relaxation for the closest string problem
    Tanaka, Shunji
    IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [6] An effective Lagrangian heuristic for the generalized assignment problem
    Haddadi, S
    Ouzia, H
    INFOR, 2001, 39 (04) : 351 - 356
  • [7] Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem
    Yuan, Yuan
    Yan, Ping
    Zhao, Liqiang
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020
  • [8] Distributed Lagrangian Relaxation Protocol for the Over-constrained Generalized Mutual Assignment Problem
    Hanada, Kenta
    Hirayama, Katsutoshi
    AGENTS IN PRINCIPLE, AGENTS IN PRACTICE, 2011, 7047 : 174 - 186
  • [9] A Heuristic Genetic Algorithm for Solving Constrained Weapon-Target Assignment Problem
    Song Zhihua
    Zhu Fashun
    Zhang Duolin
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 1, 2009, : 336 - +
  • [10] A Lagrangian based heuristic for a new class of assignment problem
    Luo, Jia-xiang
    Zhang, Mei
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 2, 2009, : 803 - 807
12345