참고문헌
- R. K. Ahuja, T.L. Magnanti, and J. B. Orlin , Network Flows: Theory, Algorithms, and Application, Prentice Hall: Englewood Cliffs, NJ, 1993.
- E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
- R. Motwani, Approximation Algorithms, Lecture Notes, Stanford University, Stanford, 2000.
- Hochbaum DS. Efficient algorithms for the inverse spanning tree problem. Operations Research 2003; 51: 785-97. https://doi.org/10.1287/opre.51.5.785.16756
- Ahuja RK, Orlin JB, Inverse optimization, part i: Linear programming and general problem, Oper Res 2001; 35: 771-783.
- Heuburger C, nverse optimization, a survey on problems, methods, and results, J Comb Optim, 2004, 361.
- Orlin JB, lnverse optimization and partial inverse optimization, PPT presentation on Optimization Day Columbia University November 3 2003.
- He Y, Zhang B, Yao E, Weighted inverse minimum spanning tree problems under Hamming distance, J Comb Optim 2005; 9: 91-100. https://doi.org/10.1007/s10878-005-5486-1
- Kruskal J.B., On the shortest spanning subtree of a gmph and the traveling salesman problem, Proceedings of the AMS 1956; 7: 48-50. https://doi.org/10.1090/S0002-9939-1956-0078686-7