A dual approach to solving a multi-objective assignment problem

Two approximation algorithms applied for solving the multi-objective assignment problem (MOAP) are proposed. The reduction to the single-objective problem is realized and dual Uzawa method is applied. The differences between algorithms are the Lagrangian construction technics, the application techni...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2018-03, Vol.973 (1), p.12039
Main Authors: Medvedeva, O A, Medvedev, S N
Format: Article
Language:English
Subjects:
Algorithms
Assignment problem
Iterative methods
Operations research
Physics
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:Two approximation algorithms applied for solving the multi-objective assignment problem (MOAP) are proposed. The reduction to the single-objective problem is realized and dual Uzawa method is applied. The differences between algorithms are the Lagrangian construction technics, the application technics of Hungarian method or independent column minimization in each iteration. The results of the comparative computational experiment are presented.
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/973/1/012039