Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros

DOI10.1016/j.laa.2016.08.020zbMath1352.05178OpenAlexW2510500928MaRDI QIDQ501232

Li Qiu, Wei Chen, Yanfang Mo, Pravin P. Varaiya

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.08.020

zbMATH Keywords

Young diagramconstrained \((0,1)\)-matrix completionfixed zerosstructure tensor

Mathematics Subject Classification ID

Applications of graph theory (05C90) Matrix completion problems (15A83)

Related Items (1)

Market implementation of multiple-arrival multiple-deadline differentiated energy services

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bidimensional allocation of seats via zero-one matrices with given line sums
• A theorem on flows in networks
• Zero-one matrices with zero trace
• Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
• Matrices of zeros and ones with fixed row and column sum vectors
• Integral matrices with given row and column sums
• Discrete tomography. Foundations, algorithms, and applications
• Hard Real-Time Computing Systems
• Combinatorial Properties of Matrices of Zeros and Ones
• Properties of a Class of (0,1)-Matrices Covering a given Matrix
• Duration-Differentiated Energy Services With a Continuum of Loads
• Combinatorial theorems and integral matrices
• Traces of Matrices of Zeros and Ones
• Inequalities: theory of majorization and its applications
• Matrices of zeros and ones with given line sums and a zero block
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros