A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE

Longcheng Liu () and Enyu Yao ()
Additional contact information
Longcheng Liu: Department of Mathematics, Zhejiang University, Hangzhou, China
Enyu Yao: Department of Mathematics, Zhejiang University, Hangzhou, China

Asia-Pacific Journal of Operational Research (APJOR), 2007, vol. 24, issue 05, 725-736

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.

Keywords: Minimum cut; inverse problem; hamming distance; strongly polynomial algorithm (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595907001474
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:24:y:2007:i:05:n:s0217595907001474

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595907001474

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().