IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v65y2016i4d10.1007_s10898-016-0412-x.html
   My bibliography  Save this article

Algorithms for the partial inverse matroid problem in which weights can only be increased

Author

Listed:
  • Zhao Zhang

    (Zhejiang Normal University)

  • Shuangshuang Li

    (Xinjiang University)

  • Hong-Jian Lai

    (West Virginia University)

  • Ding-Zhu Du

    (University of Texas at Dallas)

Abstract

In a partial inverse combinatorial problem, given a partial solution, the goal is to modify data as small as possible such that there exists an optimal solution containing the given partial solution. In this paper, we study a constraint version of the partial inverse matroid problem in which the weight can only be increased. Two polynomial time algorithms are presented for this problem.

Suggested Citation

  • Zhao Zhang & Shuangshuang Li & Hong-Jian Lai & Ding-Zhu Du, 2016. "Algorithms for the partial inverse matroid problem in which weights can only be increased," Journal of Global Optimization, Springer, vol. 65(4), pages 801-811, August.
    • Handle: RePEc:spr:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-016-0412-x
    DOI: 10.1007/s10898-016-0412-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0412-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0412-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cai, Mao-Cheng & Duin, C.W. & Yang, Xiaoguang & Zhang, Jianzhong, 2008. "The partial inverse minimum spanning tree problem when weight increase is forbidden," European Journal of Operational Research, Elsevier, vol. 188(2), pages 348-353, July.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xianyue Li & Ruowang Yang & Heping Zhang & Zhao Zhang, 2022. "Partial inverse maximum spanning tree problem under the Chebyshev norm," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3331-3350, December.
    2. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    3. Xianyue Li & Zhao Zhang & Ding-Zhu Du, 2018. "Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm," Journal of Global Optimization, Springer, vol. 70(3), pages 677-685, March.
    4. Xianyue Li & Xichao Shu & Huijing Huang & Jingjing Bai, 2019. "Capacitated partial inverse maximum spanning tree under the weighted Hamming distance," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1005-1018, November.
    5. Xianyue Li & Zhao Zhang & Ruowang Yang & Heping Zhang & Ding-Zhu Du, 2020. "Approximation algorithms for capacitated partial inverse maximum spanning tree problem," Journal of Global Optimization, Springer, vol. 77(2), pages 319-340, June.

    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. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    2. Xianyue Li & Zhao Zhang & Ding-Zhu Du, 2018. "Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm," Journal of Global Optimization, Springer, vol. 70(3), pages 677-685, March.
    3. Javad Tayyebi & Ali Reza Sepasian, 2020. "Partial inverse min–max spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1075-1091, November.
    4. Kien Trung Nguyen & Nguyen Thanh Hung, 2020. "The inverse connected p-median problem on block graphs under various cost functions," Annals of Operations Research, Springer, vol. 292(1), pages 97-112, September.
    5. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    6. Qin Wang & Tianyu Yang & Longshu Wu, 0. "General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    7. Xianyue Li & Ruowang Yang & Heping Zhang & Zhao Zhang, 2022. "Partial inverse maximum spanning tree problem under the Chebyshev norm," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3331-3350, December.
    8. 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.
    9. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
    10. Bennet Gebken & Sebastian Peitz, 2021. "Inverse multiobjective optimization: Inferring decision criteria from data," Journal of Global Optimization, Springer, vol. 80(1), pages 3-29, May.
    11. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    12. Gassner, Elisabeth, 2009. "Up- and downgrading the 1-center in a network," European Journal of Operational Research, Elsevier, vol. 198(2), pages 370-377, October.
    13. Yi Zhang & Liwei Zhang & Yue Wu, 2014. "The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 45-79, April.
    14. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    15. Diana Fanghänel, 2013. "A bilevel programming problem with maximization of a supermodular function in the lower level," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 568-584, October.
    16. Zeynep Erkin & Matthew D. Bailey & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2010. "Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach," Decision Analysis, INFORMS, vol. 7(4), pages 358-365, December.
    17. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    18. Vincent Mousseau & Özgür Özpeynirci & Selin Özpeynirci, 2018. "Inverse multiple criteria sorting problem," Annals of Operations Research, Springer, vol. 267(1), pages 379-412, August.
    19. T. R. Wang & N. Pedroni & E. Zio & V. Mousseau, 2020. "Identification of Protective Actions to Reduce the Vulnerability of Safety‐Critical Systems to Malevolent Intentional Acts: An Optimization‐Based Decision‐Making Approach," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 565-587, March.
    20. Lili Zhang & Wenhao Guo, 2023. "Inverse Optimization Method for Safety Resource Allocation and Inferring Cost Coefficient Based on a Benchmark," Mathematics, MDPI, vol. 11(14), pages 1-15, July.

    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:spr:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-016-0412-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.