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.90030OpenAlexW1504543023MaRDI QIDQ1598883
Zhenhong Liu, Zhang, Jianzhong
Publication date: 28 May 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013807829021
Related Items
On the adjustment problem for linear programs ⋮ On inverse traveling salesman problems ⋮ Unnamed Item ⋮ Inverse multi-objective combinatorial optimization ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ Capacity inverse minimum cost flow problem ⋮ A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm ⋮ Weighted inverse minimum spanning tree problems under Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
This page was built for publication: A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
