IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v24y2007i05ns0217595907001474.html
   My bibliography  Save this article

A Weighted Inverse Minimum Cut Problem Under The Bottleneck Type Hamming Distance

Author

Listed:
  • LONGCHENG LIU

    (Department of Mathematics, Zhejiang University, Hangzhou, China)

  • ENYU YAO

    (Department of Mathematics, Zhejiang University, Hangzhou, China)

Abstract

An inverse optimization problem is defined as follows. LetSdenote the set of feasible solutions of an optimization problemP, letcbe a specified cost (capacity) vector, andx0∈ S. We want to perturb the cost (capacity) vectorctodso thatx0is an optimal solution ofPwith respect to the cost (capacity) vectord, and to minimize some objective function. In this paper, we consider the weighted inverse minimum cut problem under the bottleneck type Hamming distance. For the general case, we present a combinatorial algorithm that runs in strongly polynomial time.

Suggested Citation

  • Longcheng Liu & Enyu Yao, 2007. "A Weighted Inverse Minimum Cut Problem Under The Bottleneck Type Hamming Distance," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(05), pages 725-736.
    • Handle: RePEc:wsi:apjorx:v:24:y:2007:i:05:n:s0217595907001474
    DOI: 10.1142/S0217595907001474
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595907001474
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595907001474?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.

    Citations

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


    Cited by:

    1. Longcheng Liu & Enyu Yao, 2013. "Weighted inverse maximum perfect matching problems under the Hamming distance," Journal of Global Optimization, Springer, vol. 55(3), pages 549-557, March.
    2. 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.
    3. Jiang, Yiwei & Liu, Longcheng & Wu, Biao & Yao, Enyu, 2010. "Inverse minimum cost flow problems under the weighted Hamming distance," European Journal of Operational Research, Elsevier, vol. 207(1), pages 50-54, November.

    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:wsi:apjorx:v:24:y:2007:i:05:n:s0217595907001474. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.