You are not logged in.

Switching algorithm for linear assignment problems – Speed and optimality of the Deep Greedy

Hive Streaming
First published: 01-08-2013
Size239.77 KB
Create DateSeptember 26, 2014
Last UpdatedApril 16, 2015

The linear sum assignment problem (LSAP) is a classical combinatorial optimization problem that is found in many applications. The assignment problem deals with the question of how to assign n persons to n objects in the best possible way.

In this paper we explore the worst case performance aspects of the algorithm. We prove that the algorithm is finite and analyse its computational complexity.

It also discusses a number of simplified variations of the algorithm that shed some light on how the algorithm works.

Computational results on a number of problem types show that the solutions reached by our algorithm are only slightly worse than those obtained by the auction algorithm.



Speed and optimality of the Deep Greedy switching algorithm for linear assignment problems

Are you a returning visitor?

Please confirm your email address to download
Email Address:*

Are you a new visitor?

Please confirm your details below and then click on download
Email Address: *
First Name*
Last Name*
Company Name*
Job Function*
By registering for this free service, you are agreeing that your business contact information as detailed above will be shared with organisations whose content you choose to download on this website. We will also keep you up to date as new reports arrive via our weekly newsletter service. We take privacy seriously. Please view our privacy policy and cookie policy pages for more information.
*I understand and agree
*Required field