Solving Inverse Spanning Tree Problems Through Network Flow Techniques

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Inc., New Jersey) Google Scholar
• Ahuja R. K., Orlin J. B., Stein C., Tarjan R. E. Improved algorithms for bipartite network flow problems. SIAM J. Comput. (1994) 23:903–933Crossref, Google Scholar
• Burton D., Toint P. L. On an instance of the inverse shortest paths problem. Math. Program. (1992) 53:45–61Crossref, Google Scholar
• Burton D., Toint P. L. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program (1994) 63:1–22Crossref, Google Scholar
• Burton D., Pulleyblank B., Toint P. L. The inverse shortest paths problem with upper bounds on shortest paths costs. (1994) . Working paper, Department of Mathematics, Facultes Universitaires ND de la Paix, B-5000 Namur, BelgiumGoogle Scholar
• Cormen T. H., Leiserson C. L., Rivest R. L.Introduction to Algorithms (1990) (MIT Press and McGraw-Hill, New York) Google Scholar
• Dijkstra E. A note on two problems in connection with graphs. Numeriche Math. (1959) 1:269–271Crossref, Google Scholar
• Fredman M. L., Tarjan R. E. Fibonacci heaps and their uses in improved network optimization algorithms. Proc. 25th Annual IEEE Sympos. Foundations Comput. Sci. (1984) 338–346(Full paper in J. ACM34 (1987) 596–615.)Crossref, Google Scholar
• Fulkerson D. R. An out-of-kilter method for minimal cost flow problems. SIAM J. Appl. Math. (1961) 9:18–27Crossref, Google Scholar
• Goldberg A. V., Tarjan R. E. Solving minimum cost flow problem by successive approximations. Proc. 19th ACM Sympos. Theory Comput. (1987) 7–18(Full paper in Math. O. R.15 (1990) 430–466.)Crossref, Google Scholar
• Huang S., Liu Z. On the inverse version of the minimum cost flow problem. (1995) . Working paper, Department of ISMT, School of Business and Management, Hong Kong University of Science and Technology, Hong KongGoogle Scholar
• Jonke R., Volgenant T. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing (1986) 38:325–340Crossref, Google Scholar
• Mao-cheng C., Xiao-guang Y. Inverse shortest path problems. (1994) . Technical report, Institute of Systems Sciences, Academia Sinica, Beijing, ChinaGoogle Scholar
• Sokkalingam P. T.The Minimum Cost Flow Problem: Primal Algorithms and Cost Perturbations (1995) . Unpublished dissertation, Department of Mathematics, Indian Institute of Technology, Kanpur, IndiaGoogle Scholar
• Xu S., Zhang J. An inverse problem of the weighted shortest path problems. Japanese J. Appl. Industrial Math. (1995) 12:47–59Crossref, Google Scholar