General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms

DOI10.1007/s10878-020-00577-1zbMath1503.90140OpenAlexW3023611021MaRDI QIDQ2082216

Tianyu Yang, Qin Wang, Longshu Wu

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00577-1

zbMATH Keywords

assignment problemcombinatorial algorithmrestricted inverse problemstrongly polynomial complexity

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• On an instance of the inverse shortest paths problem
• On inverse problems of optimum perfect matching
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Calculating some inverse linear programming problems
• Partial inverse assignment problems under \(l_{1}\) norm
• Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
• Inverse Optimization
• Combinatorial optimization. Theory and algorithms