Inverse Optimization

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall NJ)Google Scholar
• Ahuja R. K., Orlin J. B. Combinatorial algorithms for inverse network flow problems. (1998) . Working Paper, Sloan School of Management, MIT, Cambridge, MAGoogle Scholar
• Ahuja R. K., Orlin J. B. A faster algorithm for the inverse spanning tree problem. J. Algorithms (2000) 34:177–193Crossref, Google Scholar
• Ahuja R. K., Orlin J. B. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Oper. Res. (2001) 49:784–789Link, Google Scholar
• Burton D., Toint L. On an instance of the inverse shortest paths problem. Math. Programming (1992) 53:45–61Crossref, Google Scholar
• Burton D., Toint L. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Programming (1994) 63:1–22Crossref, Google Scholar
• Carr S. C., Lovejoy W. S. The inverse newsvendor problem: Choosing an optimal demand portfolio for capacitated resources. (1997) . Technical Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MIGoogle Scholar
• Dantzig G. B., Blattner W., Rao M. R. Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. Theory of Graphs. International Symposium (1966) (Dunod/Gordon and Breach, Paris/New York) 209–213Google Scholar
• Dembo R., Merkoulovitch L., Rosen D. Images from a portfolio. (1998) . Algorithmics Research Working Paper, Algorithmics, Inc., CanadaGoogle Scholar
• Dial B. Minimum-revenue congestion pricing Part 1: A fast algorithm for the single-origin case. (1997) . Technical Report, The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MAGoogle Scholar
• Ford L. R., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Fredman M. L., Tarjan R. E. Fibonacci heaps and their uses in improved network optimization algorithms. Proc. 25th IEEE Symposium on Foundations of Comput. Sci. (1984) 338–346Crossref, Google Scholar
• Gabow H. N., Tarjan R. E. Faster scaling algorithms for network problems. SIAM J. Comput. (1989) 18:1013–1036Crossref, Google Scholar
• Goldberg A. V. Scaling algorithms for the shortest path problem. SIAM J. Comput. (1995) 24:494–504Crossref, Google Scholar
• Goldberg A. V., Rao S. Beyond the flow decomposition barrier. J. ACM (1998) 45:753–782Crossref, Google Scholar
• Goldberg A. V., Tarjan R. E. A new approach to the maximum flow problem. Proc. the 18th ACM Symposium on the Theory of Comput. (1986) 136–146Full paper in J. of ACM 35 (1990), 873–886Crossref, Google Scholar
• Goldfarb D. Efficient dual simplex algorithms for the assignment problem. Math. Programming (1985) 33:187–203Crossref, Google Scholar
• Greenberg H. J., Woodruff D. L. An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization. Advances in Computational and Stochastic Optimization Logic Programming, and Heuristic Search (1997) (Kluwer Academic Publishers, New York) Google Scholar
• Grotschel M., Lovasz L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1986) (Springer Heidelberg)Google Scholar
• Karp R. M. A characterization of the minimum cycle mean in a diagraph. Discrete Math. (1978) 23:309–311Crossref, Google Scholar
• Meggido N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4:414–424Link, Google Scholar
• Lawler E. L. Optimal cycles in doubly weighted linear graphs. Theory of Graphs: International Symposium (1966) (Paris/New York, Dunod/Gordon and Breach) 209–213Google Scholar
• Neumann-Denzau G., Behrens J. Inversion of seismic data using tomographical reconstruction techniques for investigations of laterally inhomogeneous media. Geophysical J. Royal Astronomical Soc. (1984) 79:305–315Crossref, Google Scholar
• Nolet G.Seismic Tomography (1987) (Reidel, Dordrecht) Crossref, Google Scholar
• Orlin J. B., Ahuja R. K. New scaling algorithms for the assignment and minimum cycle mean problems. Math. Programming (1992) 54:41–56Crossref, Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (John Wiley & Sons, New York) Google Scholar
• Shan Y. Personal communication. (1999) . CSX Transportation, Jacksonville, FLGoogle Scholar
• Sheffi Y.Urban Transportation Networks (1985) (MIT, Cambridge MA) Google Scholar
• Sokkalingam P. T., Ahuja R. K., Orlin J. B. Solving inverse spanning tree problems through network flow techniques. Oper. Res. (1999) 47:291–300Link, Google Scholar
• Tarantola A.Inverse Problem Theory: Methods for Data Fitting and Model Parameter Estimation (1987) (Elsevier, Amsterdam) Google Scholar
• Woodhouse J. H., Dziewonski A. M. Mapping the upper mantle: Three dimensional modeling of Earth structure by inversion of seismic waveforms. J. Geophysical Res. (1984) 89(B7):5953–5986Crossref, Google Scholar
• Xu S., Zhang J. An inverse problem of the weighted shortest path problem. Japanese J. Indust. Appl. Math. (1995) 12:47–59Crossref, Google Scholar
• Yang C., Zhang J., Ma Z. Inverse maximum flow and minimum cut problem. Optimization (1997) 40:147–170Crossref, Google Scholar
• Zhang J., Cai M. Inverse problem of minimum cuts. ZOR Math. Methods Oper. Res. (1998) 48:51–58Crossref, Google Scholar
• Zhang J., Liu Z. Calculating some inverse linear programming problem. J. Comput. Appl. Math. (1996) 72:261–273Crossref, Google Scholar