The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

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.

Saved in:
Bibliographic Details
Published in:Computational optimization and applications 1994-03, Vol.3 (1), p.7-26
Main Authors: Kennington, Jeffery L., Mohammadi, Farin
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0926-6003
1573-2894
DOI:10.1007/BF01299389