Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Yang, Xiaoguang
and
Zhang, Jianzhong
2007.
Partial inverse assignment problems under norm.
Operations Research Letters,
Vol. 35,
Issue. 1,
p.
23.
Gassner, Elisabeth
2010.
The partial inverse minimum cut problem withL1-norm is strongly NP-hard.
RAIRO - Operations Research,
Vol. 44,
Issue. 3,
p.
241.
Demange, Marc
and
Monnot, Jérôme
2013.
Paradigms of Combinatorial Optimization.
p.
547.
Wang, Lizhi
2013.
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem.
Journal of Global Optimization,
Vol. 55,
Issue. 3,
p.
491.
2014.
Paradigms of Combinatorial Optimization.
p.
707.
Egri, Péter
Kis, Tamás
Kovács, András
and
Váncza, József
2014.
An inverse economic lot-sizing approach to eliciting supplier cost parameters.
International Journal of Production Economics,
Vol. 149,
Issue. ,
p.
80.
Demange, Marc
and
Monnot, Jérôme
2014.
Paradigms of Combinatorial Optimization.
p.
547.
Zhang, Zhao
Li, Shuangshuang
Lai, Hong-Jian
and
Du, Ding-Zhu
2016.
Algorithms for the partial inverse matroid problem in which weights can only be increased.
Journal of Global Optimization,
Vol. 65,
Issue. 4,
p.
801.
Li, Shuangshuang
Zhang, Zhao
and
Lai, Hong-Jian
2016.
Algorithm for constraint partial inverse matroid problem with weight increase forbidden.
Theoretical Computer Science,
Vol. 640,
Issue. ,
p.
119.
Xu, Guanglin
and
Burer, Samuel
2017.
A branch-and-bound algorithm for instrumental variable quantile regression.
Mathematical Programming Computation,
Vol. 9,
Issue. 4,
p.
471.
Li, Xianyue
Zhang, Zhao
and
Du, Ding-Zhu
2018.
Partial inverse maximum spanning tree in which weight can only be decreased under
$$l_p$$
l
p
-norm.
Journal of Global Optimization,
Vol. 70,
Issue. 3,
p.
677.
Li, Xianyue
Shu, Xichao
Huang, Huijing
and
Bai, Jingjing
2019.
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance.
Journal of Combinatorial Optimization,
Vol. 38,
Issue. 4,
p.
1005.
Li, Xianyue
Zhang, Zhao
Yang, Ruowang
Zhang, Heping
and
Du, Ding-Zhu
2020.
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
Journal of Global Optimization,
Vol. 77,
Issue. 2,
p.
319.
Li, Xianyue
Yang, Ruowang
Zhang, Heping
and
Zhang, Zhao
2021.
Combinatorial Optimization and Applications.
Vol. 13135,
Issue. ,
p.
389.
Li, Xianyue
Yang, Ruowang
Zhang, Heping
and
Zhang, Zhao
2022.
Partial inverse maximum spanning tree problem under the Chebyshev norm.
Journal of Combinatorial Optimization,
Vol. 44,
Issue. 5,
p.
3331.
Wang, Qin
Yang, Tianyu
and
Wu, Longshu
2022.
General restricted inverse assignment problems under $$l_1$$ and $$l_\infty $$ norms.
Journal of Combinatorial Optimization,
Vol. 44,
Issue. 3,
p.
2040.
Dong, Qingzhen
Li, Xianyue
and
Yang, Yu
2023.
Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance.
Journal of Combinatorial Optimization,
Vol. 46,
Issue. 4,
Zhang, Lili
Chen, Zhengrui
Shi, Dan
and
Zhao, Yanan
2023.
An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal Cost.
Mathematics,
Vol. 11,
Issue. 5,
p.
1178.