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

DOI10.1016/j.dam.2005.02.023zbMath1131.90430OpenAlexW2075258643MaRDI QIDQ2573240

Truls Flatberg, Geir Dahl

Publication date: 7 November 2005

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

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

zbMATH Keywords

integer programmingdiscrete tomography

Mathematics Subject Classification ID

Boolean programming (90C09) Matrices of integers (15B36)

Related Items (7)

A simulated annealing for reconstructing hv-convex binary matrices ⋮ Reconstructing convex matrices by integer programming approaches ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Convex \((0, 1)\)-matrices and their epitopes ⋮ Reconstructing (0,1)-matrices from projections using integer programming ⋮ Approximating hv-Convex Binary Matrices and Images from Discrete Projections

Uses Software

• CPLEX

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• A theorem on flows in networks
• Reconstructing (0,1)-matrices from projections using integer programming
• 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
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Inequalities: theory of majorization and its applications
• Unnamed Item

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