Singly constrained assignment problem: a Lagrangian relaxation heuristic algorithm

被引:0
|
作者
Kennington, Jeffery L. [1 ]
Mohammadi, Farin [1 ]
机构
[1] Southern Methodist Univ, Dallas, United States
关键词
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 条