General restricted inverse assignment problems under $$l_1$$ l 1 and $$l_\infty $$ l ∞ norms

Qin Wang, Tianyu Yang and Longshu Wu ()
Additional contact information
Qin Wang: China Jiliang University
Tianyu Yang: China Jiliang University
Longshu Wu: China Jiliang University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 3, No 35, 2040-2055

Abstract: Abstract In this paper, we study the general restricted inverse assignment problems, in which we can only change the costs of some specific edges of an assignment problem as less as possible, so that a given assignment becomes the optimal one. Under $$l_1$$ l 1 norm, we formulate this problem as a linear programming. Then we mainly consider two cases. For the case when the specific edges are only belong to the given assignment, we show that this problem can be reduced to some variations of the minimum cost flow problems. For the case when every specific edge does not belong to the given assignment, we show that this problem can be solved by a minimum cost circulation problem. In both cases, we present some combinatorial algorithms which are strongly polynomial. We also study this problem under the $$l_\infty $$ l ∞ norm. We propose a binary search algorithm and prove that the optimal solution can be obtained in polynomial time.

Keywords: Restricted inverse problem; Assignment problem; Strongly polynomial complexity; Combinatorial algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00577-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00577-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00577-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().