Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values

Progress in Natural Science: Materials International

Volumn 16, Issue 6, 2006, Pages 649-655

  Liu, Longcheng ^a   He, Yong ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Computational complexity; Inverse problem; Minimum spanning tree; Reverse problem; Shortest path problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

DISCRETE VALUES; IMPROVEMENT PROBLEMS; MINIMUM SPANNING TREE PROBLEM; MINIMUMS PANNING TREE; NETWORK IMPROVEMENT; NP COMPLETE; REVERSE PROBLEMS; SHORTEST PATH PROBLEM; STRONGLY POLYNOMIAL ALGORITHM; THREE MODELS;

INVERSE PROBLEMS;

EID: 84899783671     PISSN: 10020071     EISSN: None     Source Type: Journal    
DOI: 10.1080/10020070612330048     Document Type: Article

References (5)

1. Heuberger C. Inverse optimization: A survey on problems methods, and results. Journal of Combinatorial Optimization, 2004, 8:329-361.
2. Ahuja R. K. and Orlin J. B. A faster algorithm for the inverse spanning tree problem. Journal of Algorithms, 2000, 34:177-193.
3. Dell'Amico M., Maffioli F., and Malucelli F. The base-matroid and inverse combinatorial optimization. Discrete Applied Mathematics, 2003, 128:337-353.
4. Hochbaum D. S. Efficient algorithms for the inverse spanning-tree problem. Operations Research, 2003, 51:795-797.
5. Zhang J. and Lin Y. Computation of the reverse shortest-path problem. Journal of Global Optimization, 2003, 25:243-261.