Hostname: page-component-848d4c4894-xm8r8 Total loading time: 0 Render date: 2024-06-23T02:41:03.482Z Has data issue: false hasContentIssue false
  • English
  • Français

Complexity of Partial Inverse Assignment Problem and PartialInverse Cut Problem

Published online by Cambridge University Press:  15 August 2002

Xiaoguang Yang
Xiaoguang Yang*
Affiliation:
Laboratory of Management, Decision and Information Systems, Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, P.R. China; xgyang@iss04.iss.ac.cn.
Get access

Abstract

For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.

Keywords

Partial inverse assignment problempartial inverse minimum cut problemNP–hard.
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 1 , January 2001 , pp. 117 - 126
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

R.K. Ahuja and J.B. Orlin, Inverse optimization, Part I: Linear programming and general problems, Working Paper, SWP#4002. Sloan School of Management, MIT, Cambridge, MA (1998).
R.K. Ahuja and J.B. Orlin, Inverse optimization, Part II: Network flow problems, Working Paper, SWP#4003. Sloan School of Management, MIT, Cambridge, MA (1998).
R.K. Ahuja and J.B. Orlin, Combinatorial algorithms for inverse network flow problems, Working Paper, SWP#4004. Sloan School of Management, MIT, Cambridge, MA (1998).
Cai, M., Yang, X. and Inverse, Y. Li polymatroidal flow problem. J. Comb. Optim. 3 (1999) 115-126. CrossRef
Cai, M., Yang, X. and Inverse, Y. Li problems of submodular functions on digraphs. J. Optim. Theory Appl. 104 (2000) 559-575. CrossRef
M. Cai, X. Yang and J. Zhang, Inverse problems with partial given solution, Working Paper. Department of Mathematics, City University of Hong Kong (1997).
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide of the Theory of NP-Completeness. Freeman, San Francisco (1979).
Yang, C. and Zhang, J., Inverse maximum flow and minimum cut problems. Optimization 40 (1997) 147-170. CrossRefPubMed
Zhang, J. and Cai, M., Inverse problem of minimum cuts. ZOR-Math. Methods Oper. Res. 48 (1998) 51-58. CrossRef
Zhang, J. and Ma, Z., A network flow method for solving some inverse combinatorial optimization problems. Optimization 37 (1996) 59-72. CrossRefPubMed