Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0993.90068
Yang, Xiaoguang
Complexity of partial inverse assignment problem and partial inverse cut problem. (English)
[J] RAIRO, Oper. Res. 35, No.1, 117-126 (2001). ISSN 0399-0559; ISSN 1290-3868/e

Summary: 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.

MSC 2000:: *90B80 Discrete location and assignment
90C27 Combinatorial programming
68Q25 Analysis of algorithms and problem complexity
90B10 Flows in networks
68Q17 Computational difficulty of problems
90C60 Abstract computational complexity for math. programming problems

Keywords: partial inverse assignment problem; partial inverse minimum cut problem; NP-hard

Cited in: Zbl 1206.90141

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]