A weighted inverse minimum cut problem under the bottleneck type hamming distance

Asia-Pacific Journal of Operational Research

Volumn 24, Issue 5, 2007, Pages 725-736

  Liu, Longcheng ^a   Yao, Enyu ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Hamming distance; Inverse problem; Minimum cut; Strongly polynomial algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING; VECTOR QUANTIZATION;

INVERSE PROBLEM; MINIMUM CUT PROBLEMS; STRONGLY POLYNOMIAL ALGORITHMS;

INVERSE PROBLEMS;

EID: 37249033684     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595907001474     Document Type: Article

References (8)

1. Duin, CW and A Volgenant (2006). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, 170, 887-899.
2. He Y, B Zhang and E Yao (2005). Wighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization, 9, 91-100.
3. Heuberger C (2004). Inverse Optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization, 8, 329-361.
4. Liu, LC and JZ Zhang (2006). Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization, 12, 395-408.
5. Yang C, J Zhang and Z Ma (1997). Inverse maximum flow and minimum cut problems. Optimization, 40, 147-170.
6. Yang, XG and JZ Zhang (2005). Inverse sorting problems by minimizing total number of changes and partial inverse sorting problems. Technical Report, Dept. of Math., City University of Hong Kong.
7. Zhang B, J Zhang and Y He (2006). Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. Journal of Global Optimization, 34, 464-474.
8. Zhang B, J Zhang and Y He (2005). The center location improvement problem under the Hamming distance. Journal of Combinatorial Optimization, 9, 187-198.