Partial inverse assignment problems under \(l_{1}\) norm
From MaRDI portal
Publication:2643813
DOI10.1016/j.orl.2005.12.003zbMath1278.90421MaRDI QIDQ2643813
Xiao-guang Yang, Zhang, Jianzhong
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
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance, Algorithms for the partial inverse matroid problem in which weights can only be increased, 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, An interior-point algorithm for solving inverse linear optimization problem
Cites Work
- Unnamed Item
- A further study on inverse linear programming problems
- On inverse problems of optimum perfect matching
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
- Inverse Optimization
- A network flow method for solving some inverse combinatorial optimization problems
