Partial inverse assignment problems under l₁ norm

DOI10.1016/J.ORL.2005.12.003MaRDI QIDQ2643813zbMATH OpenOpenAlexFDO

Authors Xiaoguang Yang, Jianzhong Zhang

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2005.12.003

zbMATH Keywords

assignment problempartial inverse optimizationpolynomially solvable problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms
• Complexity of partial inverse assignment problem and partial inverse cut problem
• Calculating some inverse linear programming problems
• Inverse Optimization
• Combinatorial algorithms for inverse network flow problems

Cites work

• A further study on inverse linear programming problems
• A network flow method for solving some inverse combinatorial optimization problems
• Calculating some inverse linear programming problems
• Complexity of partial inverse assignment problem and partial inverse cut problem
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse Optimization
• On inverse problems of optimum perfect matching

Cited in

(15)

• A branch-and-bound algorithm for instrumental variable quantile regression
• Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
• General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms
• Partial inverse maximum spanning tree problem under the Chebyshev norm
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Complexity of partial inverse assignment problem and partial inverse cut problem
• An interior-point algorithm for solving inverse linear optimization problem
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
• A combinatorial algorithm for inverse continuous quadratic knapsack problem

This page was built for publication: Partial inverse assignment problems under \(l_{1}\) norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643813)