Inverse optimization in high-speed networks

Discrete Applied Mathematics

Volumn 129, Issue 1, 2003, Pages 83-98

  Faragó, András ^a   Szentesi, Áron ^b   Szviatovszki, Balázs ^b  

^a The University of Texas at Dallas   (United States)

^b ERICSSON RESEARCH   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867976666     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00235-4     Document Type: Conference Paper

References (26)

1. R.K. Ahuja, J.B. Orlin, Solving the convex ordered set problem with applications to isotonic regression, Working Paper SWP# 3988, MIT Sloan School of Management, Cambridge, MA, 1997.
2. R.K. Ahuja, J.B. Orlin, Inverse optimization, Part I: linear programming and general problem, Working Paper SWP# 4002, MIT Sloan School of Management, Cambridge, MA, 1998.
3. R.K. Ahuja, J.B. Orlin, A fast algorithm for the bipartite node weighted matching problem on path graphs with application to the inverse spanning tree problem, Working Paper SWP# 4006, MIT Sloan School of Management, Cambridge, MA, 1998.
4. D. Burton, B. Pulleyblank, Ph.L. Toint, The inverse shortest path problem with upper bounds on shortest paths costs, in: P. Bartalos, D.W. Hear, W.H. Hager (Eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 450, pp. 156-171.
5. D. Burton, and Ph.L. Toint On an instance of the inverse shortest path problem Math. Programming 53 1992 45 61
6. D. Burton, and Ph.L. Toint On the use of an inverse shortest path algorithm for recovering linearly correlated costs Math. Programming 63 1994 1 22
7. M. Cai, X. Yang, Inverse shortest path problems, Technical Report, Institute of Systems Sciences, Academia Sinica, Beijing, China, 1994.
8. M. Cai, X. Yang, Y. Li, Inverse polymatroidal flow problem, Research Report, Institute of Systems Science, Chinese Academy of Science, Beijing, China, 1996.
9. A. Faragó, S. Blaabjerg, L. Ast, G. Gordos, and T. Henk A new degree of freedom in ATM network dimensioning: optimizing the logical configuration IEEE J. Selected Areas Commun. 13 1995/7 1199 1206
10. A. Girard Routing and Dimensioning in Circuit-switched Networks 1990 Addison-Wesley Reading, MA
11. Zs. Haraszti, I. Dahlquist, A Faragó, T. Henk, PLASMA - an integrated tool for ATM network operation, International Switching Symposium (ISS'95), Berlin, 1995, pp. 314-318.
12. Z. Hu, Z. Liu, A strongly polynomial algorithm for the inverse shortest arborescence problem, Working Paper, Institute of Systems Sciences, Academia Sinica, Beijing, China, 1995.
13. S. Hunag, Z. Liu, On the inverse problem of k-matching of bipartite graphs, Working Paper, School of Business and Management, Hong Kong University of Science and Technology, Hong Kong, 1995.
14. S. Hunag, Z. Liu, On the inverse version of the minimum cost flow problem, Working Paper, School of Business and Management, Hong Kong University of Science and Technology, Hong Kong, 1995.
15. Y. Li, Inverse combinatorial optimization problems and connected factor problems, Dissertation, Institute of Systems Science, Chinese Academy of Science, Beijing, China, 1996.
16. Z. Ma, S. Xu, J. Zhang, Algorithms for inverse minimum spanning tree problem, Working Paper, Department of Mathematics, City Polytechnic of Hong Kong, Hong Kong, 1996.
17. Private Network-Network Interface Specification, Version 1.0 (PNNI 1.0), The ATM Forum, Technical Committee, March 1996.
18. J. Roberts, U. Mocci, J. Virtamo (Eds.), Broadband Network Traffic, Springer, Berlin, 1996.
19. A. Schrijver Theory of Linear and Integer Programming 1990 Wiley New York
20. P.T. Sokkalingam, The minimum cost flow problem: primal algorithms and cost perturbations, Dissertation, Department of Mathematics, Indian Institute of Technology, Kanpur, India, 1996.
21. P.T. Sokkalingam, R.K. Ahuja, J.B. Orlin, Solving the inverse spanning tree problems through network flow techniques, Working Paper SWP# 3890, MIT Sloan School of Management, Cambridge, MA, 1996.
22. É. Tardos A strongly polynomial algorithm to solve combinatorial linear programs Oper. Res. 34 1986 250 256
23. S. Xu, and J. Zhang An inverse problem of the weighted shortest path problem Japan J. Ind. Appl. Math. 12 1995 47 59
24. C. Yang, J. Zhang, and Z. Ma Inverse maximum flow and minimum cut problem Optimization 40 1997 147 170
25. J. Zhang, and M.C. Cai Inverse problem of minimum cuts Math. Methods Oper. Res. 47 1998 1
26. J. Zhang, Z. Ma, and C. Yang A column generation method for inverse shortest path problems ZOR-Math. Methods Oper. Res. 41 1995 347 358