1 |
Ahuja, R. K., T. L. Magnanti, and J. B. Orlin, Network ows, Theory, algorithms and applications, Prentice-Hall, New York, 1993.
|
2 |
Ahuja, R. K. and J. B. Orlin, "A faster algorithm for the inverse spanning tree problem," Journal of Algorithms 34, 1 (2000), 177-193.
DOI
ScienceOn
|
3 |
Chung, Y., Inverse combinatorial optimization problems and applications, Paris 1 University, Ph.D. thesis, Department of Computer Science, 2010.
|
4 |
Chung, Y. and M. Demange, "Some inverse traveling salesman problems," 4OR 10, 2 (2012), 193-209.
DOI
|
5 |
Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
|
6 |
Sokkalingam, P. T., P. K. Ahuja, and J. B. Orlin, "Solving inverse spanning tree problems through network flow techniques," Operations Research 47 (1999), 291-298.
DOI
ScienceOn
|
7 |
Ye, Y., "An potential reduction algorithm for linear programming," Mathematical Programming 50 (1991), 239-258.
DOI
|
8 |
Zhang, J., S. Xu, and Z. Ma, "An algorithm for inverse minimum spanning tree problem," Optimization Methods and Software 8, 1 (1997), 69-84.
DOI
ScienceOn
|
9 |
Zhang, J., Z. Liu, and Z. Ma, "On the inverse problem of minimum spanning tree with partition constraints," Mathematical Methods of Operations Research 44 (1996), 171-187.
DOI
|