Weiß, C, Knust, S, Shakhlevitch, NV et al. (1 more author) (2016) The Assignment Problem with Nearly Monge Arrays and Incompatible Partner Indices. Discrete Applied Mathematics, 211. pp. 183-203. ISSN 0166-218X
Abstract
In this paper we study the d-dimensional assignment problem in which entries of the cost array satisfy the Monge property, except for ∞-entries, which may violate it. We assume that the ∞-entries are incurred by incompatible partner indices and their number is bounded by an upper bound λ for each index. We show that the problem can be solved in linear time for fixed d and λ, and it becomes strongly NP-hard if d or λ is part of the input.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | (c) 2016, The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/) | ||||
Keywords: | assignment problem, Monge property, Monge array | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 20 Apr 2016 12:16 | ||||
Last Modified: | 05 Oct 2017 16:50 | ||||
Published Version: | http://doi.org/10.1016/j.dam.2016.04.019 | ||||
Status: | Published | ||||
Publisher: | Elsevier | ||||
Identification Number: | https://doi.org/10.1016/j.dam.2016.04.019 |