1. Agarwal, S., Mittal, A. K., and Sharma, P. (1984). Constrained optimum communication trees and sensitivity analysis. SIAM Journal on Computing, 13 (2): 315–328.
2. Arsham, H. (1994). A solution algorithm with sensitivity analysis for optimal matchings and related problems. Congressus Numerantium, 102 (2): 193–230.
3. Bailey, M. G. and Gillett, B. E. (1980). Parametric integer programming analysis: A contraction approach. Journal of the Operational Research Society, 31 (3): 257–262.
4. Ball, M. O. and Taverna, R. (1985/6). Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint. Annals of Operations Research, 4: 25–56.
5. Bank, B. (1980). Stability analysis in pure and mixed-integer linear programming. Number 23 in Lecture Notes in Control and Information Science, pages 148–153. Springer-Verlag, Berlin, Germany.