Integer matrices with constraints on leading partial row and column sums

DOI10.1016/j.dam.2010.06.010zbMath1205.90201OpenAlexW1979104483MaRDI QIDQ602764

Stephen E. Wright

Publication date: 5 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.010

zbMATH Keywords

network flowtotally unimodular matrixconsistent matrix rounding

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (1)

Embedding multidimensional grids into optimal hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Embedding grids into hypercubes
• The maximum deviation just-in-time scheduling problem.
• Roundings respecting hard constraints
• Combinatorial Properties of Matrices of Zeros and Ones
• Embedding of Grids into Optimal Hypercubes
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning
• Degree-Constrained Network Spanners with Nonconstant Delay
• Matrix Rounding Problems
• Unbiased Matrix Rounding
• Matrices of zeros and ones with given line sums and a zero block
• Matrices of zeros and ones with given line sums and a zero block

This page was built for publication: Integer matrices with constraints on leading partial row and column sums