Inverse constrained bottleneck problems under weighted norm-Reference-Cited by-同舟云学术

Inverse constrained bottleneck problems under weighted norm

Published:2007-11 Issue:11 Volume:34 Page:3243-3254
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Guan Xiucui,Zhang Jianzhong

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference12 articles.

1. Inverse optimization, a survey on problems, methods, and results;Heuberger;Journal of Combinatorial Optimization,2004

2. Duin CW, Volgenant A. Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, available online 17 November 2004.

3. Efficient algorithms for the inverse spanning tree problem;Hochbaum;Operations Research,2003

4. The complexity analysis of the inverse center location problem;Cai;Journal of Global Optimization,1999

5. Inverse maximum capacity problems;Yang;OR Spektrum,1998

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

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

2. The inverse k-max combinatorial optimization problem;Yugoslav Journal of Operations Research;2023

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

4. The minmax regret inverse maximum weight problem;Applied Mathematics and Computation;2021-10

5. Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector;Journal of Global Optimization;2017-07-15