Some inverse min-max network problems under weighted l1 and l∞ norms with bound constraints on changes

Journal of Combinatorial Optimization

Volumn 13, Issue 2, 2007, Pages 123-135

  Yang, Xiaoguang ^a   Zhang, Jianzhong ^b  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bound constraints; Inverse min max network problem; Polynomial time algorithms; Weighted l norm; Weighted l1 norm

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

BOUND CONSTRAINTS; INVERSE MIN-MAX NETWORK PROBLEMS; POLYNOMIAL TIME ALGORITHMS; WEIGHTED L1 NORM;

INVERSE PROBLEMS;

EID: 33845933174     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9016-6     Document Type: Article

References (25)

1. Ahmed S, Guan YP (2005) The inverse optimal value problem. Math Program 102:91-110
2. Ahuja RK, Orlin JB (2001) Inverse optimization, part i: linear programming and general problem. Oper Res 35:771-783
3. Ahuja RK, Orlin JB (2000) A faster algorithm for the inverse spanning tree problem. J Algorithms 34:177-193
4. Burkard R, Pleschiutschnig C, Zhang JZ (2004) Inverse median problems. Discrete Optim 1:23-39
5. Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Math Program 53:45-61
6. Burton D, Toint PhL (1994) On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math Program 63:1-22
7. Cai MC, Yang XG (1995) Inverse shortest path problems. Operations research and its applications. In: First international symposium ISORA'95 Beijing PR China
8. Cai MC, Yang XG, Zhang J (1999) The complexity analysis of the inverse center location problem. J Global Optim 15:213-218
9. Camerini PM (1978) The min-max spanning tree problem and some extensions. Inf Proc Lett 7:10-14
10. Hao J, Orlin JB (1994) A faster algorithm for finding the minimum cut in a directed graph. J Algorithms 17:424-446
11. Heuburger C (2004) Inverse optimization, a survey on problems, methods, and results. J Comb Optim 8:329-361
12. Hochbaum DS (2003) Efficient algorithms for the inverse spanning tree problem. Oper Res 51:785-797
13. He Y, Zhang B, Yao E (2005) Weighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9:91-100
14. Iyengar G, Kang WM (2005) Inverse conic programming with applications. Oper Res Lett 33:319-330
15. Liu LC, He Y (2006) Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values. Prog Nat Sci 16:649-655
16. Nagamochi H, Ibaraki T (1992) Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J Discrete Math 5:54-66
17. Orlin JB (2003) Inverse optimization and partial inverse optimization. PPT presentation on Optimization Day Columbia University November 3
18. Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer-Verlag Berlin and Heidelberg
19. Sokkalingam PT, Ahuja RK, Orlin JB (1999) Solving inverse spanning tree problems through network flow techniques. Oper Res 47:291-298
20. Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J Ind Appl Math 12:47-59
21. Yang C, Zhang J (1998) Inverse maximum capacity problems. OR Spektrum 20:97-100
22. Yang C, Zhang J (1999) Two general methods for inverse optimization problems. Appl Math Lett 12:69-72
23. Zhang J, Liu Z (1999) A further study on inverse linear programming problems. J Comput Appl Math 106:345-359
24. Zhang J, Ma Z (1996) A network flow method for solving some inverse combinatorial optimization problems. Optimization 37:59-72
25. Zhang J, Xu S, Ma Z (1997) An algorithm for inverse minimum spanning tree problem. Optim Meth Soft 8:69-84