Optimization and reconstruction of hv-convex (0,1)-matrices

DOI10.1016/S1571-0653(04)00474-3zbMath1138.90428OpenAlexW2179770018MaRDI QIDQ3438901

Truls Flatberg, Geir Dahl

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00474-3

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items (1)

An evolutionary algorithm for discrete tomography

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• A theorem on flows in networks
• Discrete tomography. Foundations, algorithms, and applications
• On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
• The reconstruction of polyominoes from their orthogonal projections
• Generating convex polyominoes at random
• Combinatorial Properties of Matrices of Zeros and Ones
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Inequalities: theory of majorization and its applications

This page was built for publication: Optimization and reconstruction of hv-convex (0,1)-matrices