Inverse zero-sum problems {III}
Weidong Gao, Alfred Geroldinger, David J. Grynkiewicz (2010)
Acta Arithmetica
Similarity:
Weidong Gao, Alfred Geroldinger, David J. Grynkiewicz (2010)
Acta Arithmetica
Similarity:
G. R. Gordh Jr., Sibe Mardešić (1975)
Colloquium Mathematicae
Similarity:
R. Duda (1971)
Colloquium Mathematicae
Similarity:
I. Lončar (1986)
Matematički Vesnik
Similarity:
Ewa Sylwestrzak (2002)
Applicationes Mathematicae
Similarity:
An inverse problem for a nonlocal problem describing the temperature of a conducting device is studied.
I. Lončar (1990)
Matematički Vesnik
Similarity:
Romanov, V.G. (2004)
Sibirskij Matematicheskij Zhurnal
Similarity:
Jan Bochenek (1971)
Annales Polonici Mathematici
Similarity:
Xiaoguang Yang (2010)
RAIRO - Operations Research
Similarity:
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.
Kim, In-Jae, Shader, Bryan L. (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: