IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2697.html
   My bibliography  Save this paper

Inverse optimization

Author

Listed:
  • Ahuja, Ravindra K., 1956-
  • Orlin, James B., 1953-

Abstract

"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.

Suggested Citation

  • Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Inverse optimization," Working papers WP 4003-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2697
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2697
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jianzhong Zhang & Mao Cai, 1998. "Inverse problem of minimum cuts," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(1), pages 51-58, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    2. Chung, Yerim & Culus, Jean-François & Demange, Marc, 2015. "Inverse chromatic number problems in interval and permutation graphs," European Journal of Operational Research, Elsevier, vol. 243(3), pages 763-773.
    3. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    4. M. Cai & X. Yang & Y. Li, 2000. "Inverse Problems of Submodular Functions on Digraphs," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 559-575, March.
    5. Zhenhong Liu & Jianzhong Zhang, 2003. "On Inverse Problems of Optimum Perfect Matching," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 215-228, September.
    6. Zhang, Jianzhong & Liu, Zhenhong & Ma, Zhongfan, 2000. "Some reverse location problems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 77-88, July.
    7. Adrian Deaconu & Laura Ciupala, 2020. "Inverse Minimum Cut Problem with Lower and Upper Bounds," Mathematics, MDPI, vol. 8(9), pages 1-10, September.
    8. Rishabh Gupta & Qi Zhang, 2022. "Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2720-2735, September.
    9. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Combinatorial algorithms for inverse network flow problems," Working papers WP 4004-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. Timothy C. Y. Chan & Katharina Forster & Steven Habbous & Claire Holloway & Luciano Ieraci & Yusuf Shalaby & Nasrin Yousefi, 2022. "Inverse optimization on hierarchical networks: an application to breast cancer clinical pathways," Health Care Management Science, Springer, vol. 25(4), pages 590-622, December.
    11. Ravindra K. Ahuja & James B. Orlin, 2001. "Inverse Optimization," Operations Research, INFORMS, vol. 49(5), pages 771-783, October.
    12. Timothy C. Y. Chan & Maria Eberg & Katharina Forster & Claire Holloway & Luciano Ieraci & Yusuf Shalaby & Nasrin Yousefi, 2022. "An Inverse Optimization Approach to Measuring Clinical Pathway Concordance," Management Science, INFORMS, vol. 68(3), pages 1882-1903, March.

    More about this item

    Keywords

    HD28 .M414 no.4003-98;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2697. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.