Some properties of matrices from certain binary mathematical programming problems
DOI10.1016/0893-9659(90)90041-9zbMATH Open0709.15015OpenAlexW2010145139MaRDI QIDQ921091FDOQ921091
Authors: Bruce E. Feiring
Publication date: 1990
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0893-9659(90)90041-9
Recommendations
- scientific article; zbMATH DE number 1492858
- On some classes of matrices related to solving linear complementarity problems as linear programs
- Some Results Concerning the Reduction of Binary Matrices
- Binary matrices and some combinatorial applications in the theory of \(k\)-valued functions
- Matrices with some extremal properties
- Matrix mathematical programming problems
- The Matrix Dynamic Programming Property and Its Implications
- Optimization with binet matrices
- Properties of regular mathematical programming problems
- Properties of regular mathematical programming problems
Eigenvalues, singular values, and eigenvectors (15A18) Integer programming (90C10) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
Cited In (4)
This page was built for publication: Some properties of matrices from certain binary mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921091)