Partial inverse assignment problems under l1 norm

Partial inverse assignment problems under l1 norm

0.00 Avg rating0 Votes
Article ID: iaor20073038
Country: Netherlands
Volume: 35
Issue: 1
Start Page Number: 23
End Page Number: 28
Publication Date: Jan 2007
Journal: Operations Research Letters
Authors: ,
Keywords: optimization, programming: assignment
Abstract:

In this paper, we consider the partial inverse assignment problem under l1 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0–1 combinatorial optimization problems.

Reviews

Required fields are marked *. Your email address will not be published.