Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...