Abstract
Let (Formula presented.) denote the class of (0,1) square matrices containing in each row and in each column exactly k 1’s. The minimal value of k, for which the behavior of the permanent in (Formula presented.) is not quite studied, is k = 3. We give a simple algorithm for calculation of upper magnitudes of permanent in (Formula presented.) and consider some extremal problems in a generalized class Λn(α, β, γ), the matrices of which contain in each row and in each column nonzero elements α, β, and γ and n − 3 zeros.
Original language | English |
---|---|
Article number | 289829 |
Journal | Journal of Optimization |
Volume | 2013 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2013 |
ASJC Scopus subject areas
- Analysis
- Control and Optimization
- Decision Sciences (miscellaneous)