Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
