General restricted inverse assignment problems under l1 and l∞ norms

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 norm, we formulate this problem as a linear programming...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 44; no. 3; pp. 2040 - 2055
Main Authors:	Wang, Qin, Yang, Tianyu, Wu, Longshu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2022 Springer Nature B.V
Subjects:	Combinatorial analysis Combinatorics Convex and Discrete Geometry Linear programming Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Minimum cost Norms Operations research Operations Research/Decision Theory Optimization Polynomials Search algorithms Theory of Computation Strongly polynomial complexity Restricted inverse problem Assignment problem Combinatorial algorithm
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!