Partial inverse min–max spanning tree problem-Reference-Cited by-同舟云学术

Partial inverse min–max spanning tree problem

Published:2020-09-27 Issue:4 Volume:40 Page:1075-1091
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Tayyebi Javad^ORCID,Sepasian Ali Reza

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-020-00656-3.pdf

Reference34 articles.

1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, USA

2. Ahuja RK, Orlin JB (2000) A faster algorithm for the inverse spanning tree problem. J Algorithms 34(1):177–193

3. Ahuja RK, Orlin JB (2001) Inverse optimization. Oper Res 49(5):771–783

4. Babier A, Boutilier JJ, Sharpe MB, McNiven AL, Chan TC (2018) Inverse optimization of objective function weights for treatment planning using clinical dose-volume histograms. Phys Med Biol 63(10):105004

5. Bard JF (1991) Some properties of the bilevel programming problem. J Optim Theory Appl 68(2):371–378

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inverse Optimization: Theory and Applications;Operations Research;2023-12-19

2. Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance;Journal of Combinatorial Optimization;2023-11

3. Partial inverse maximum spanning tree problem under the Chebyshev norm;Journal of Combinatorial Optimization;2022-08-30

4. Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ norm by modifying max-weight vector;Journal of Global Optimization;2022-05-16

5. Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance;Algorithmic Aspects in Information and Management;2022