Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Partial Inverse Minimum Spanning Tree with Constant Total Weight under the Bottleneck Hamming Distance

Ji Li, Xian-Yue Li, Hao-Ran Wu and Yu-Hong Shi
Journal of the Operations Research Society of China (2025)
https://doi.org/10.1007/s40305-025-00608-w

Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance

Qingzhen Dong, Xianyue Li and Yu Yang
Journal of Combinatorial Optimization 46 (4) (2023)
https://doi.org/10.1007/s10878-023-01093-8

An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal Cost

Lili Zhang, Zhengrui Chen, Dan Shi and Yanan Zhao
Mathematics 11 (5) 1178 (2023)
https://doi.org/10.3390/math11051178

General restricted inverse assignment problems under $$l_1$$ and $$l_\infty $$ norms

Qin Wang, Tianyu Yang and Longshu Wu
Journal of Combinatorial Optimization 44 (3) 2040 (2022)
https://doi.org/10.1007/s10878-020-00577-1

Partial inverse maximum spanning tree problem under the Chebyshev norm

Xianyue Li, Ruowang Yang, Heping Zhang and Zhao Zhang
Journal of Combinatorial Optimization 44 (5) 3331 (2022)
https://doi.org/10.1007/s10878-022-00903-9

Combinatorial Optimization and Applications

Xianyue Li, Ruowang Yang, Heping Zhang and Zhao Zhang
Lecture Notes in Computer Science, Combinatorial Optimization and Applications 13135 389 (2021)
https://doi.org/10.1007/978-3-030-92681-6_31

Approximation algorithms for capacitated partial inverse maximum spanning tree problem

Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang and Ding-Zhu Du
Journal of Global Optimization 77 (2) 319 (2020)
https://doi.org/10.1007/s10898-019-00852-4

Capacitated partial inverse maximum spanning tree under the weighted Hamming distance

Xianyue Li, Xichao Shu, Huijing Huang and Jingjing Bai
Journal of Combinatorial Optimization 38 (4) 1005 (2019)
https://doi.org/10.1007/s10878-019-00433-x

Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm

Xianyue Li, Zhao Zhang and Ding-Zhu Du
Journal of Global Optimization 70 (3) 677 (2018)
https://doi.org/10.1007/s10898-017-0554-5

Algorithms for the partial inverse matroid problem in which weights can only be increased

Zhao Zhang, Shuangshuang Li, Hong-Jian Lai and Ding-Zhu Du
Journal of Global Optimization 65 (4) 801 (2016)
https://doi.org/10.1007/s10898-016-0412-x

Algorithm for constraint partial inverse matroid problem with weight increase forbidden

Shuangshuang Li, Zhao Zhang and Hong-Jian Lai
Theoretical Computer Science 640 119 (2016)
https://doi.org/10.1016/j.tcs.2016.06.002

An inverse economic lot-sizing approach to eliciting supplier cost parameters

Péter Egri, Tamás Kis, András Kovács and József Váncza
International Journal of Production Economics 149 80 (2014)
https://doi.org/10.1016/j.ijpe.2013.06.024

The partial inverse minimum cut problem withL1-norm is strongly NP-hard

Elisabeth Gassner
RAIRO - Operations Research 44 (3) 241 (2010)
https://doi.org/10.1051/ro/2010017