Integer matrices with constraints on leading partial row and column sums
type: Item
instance of: scholarly article
title: Integer matrices with constraints on leading partial row and column sums
zbMATH Open document ID: 1205.90201
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5810814
zbMATH Keywords: consistent matrix rounding
zbMATH Keywords: network flow
zbMATH Keywords: totally unimodular matrix
author: Stephen E. Wright
MaRDI profile type: Publication
full work available at URL: j.dam.2010.06.010
OpenAlex ID: W1979104483
cites work: Q3056948
cites work: Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
cites work: Matrix Rounding Problems
cites work: Embedding grids into hypercubes
cites work: The maximum deviation just-in-time scheduling problem.
cites work: Matrices of zeros and ones with given line sums and a zero block
cites work: Embedding of Grids into Optimal Hypercubes
cites work: Roundings respecting hard constraints
cites work: Unbiased Matrix Rounding
cites work: Q5514188
cites work: A theorem on flows in networks
cites work: Q3236252
cites work: Degree-Constrained Network Spanners with Nonconstant Delay
cites work: Combinatorial Properties of Matrices of Zeros and Ones
cites work: Q3818127
cites work: Level Schedules for Mixed-Model, Just-in-Time Processes
DOI: 10.1016/J.DAM.2010.06.010
description: scientific article; zbMATH DE number 5810814