A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
From MaRDI portal
Publication:1598883
DOI10.1023/A:1013807829021zbMath1032.90030MaRDI QIDQ1598883
Zhenhong Liu, Zhang, Jianzhong
Publication date: 28 May 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items
Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm, Inverse problems and solution methods for a class of nonlinear complementarity problems, Weighted inverse minimum spanning tree problems under Hamming distance, On inverse traveling salesman problems, Capacity inverse minimum cost flow problem, On the adjustment problem for linear programs, Inverse multi-objective combinatorial optimization, The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments, A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm