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