Reconstructing convex matrices by integer programming approaches

DOI10.1007/S10852-012-9193-5zbMATH Open1280.65040OpenAlexW1964092208MaRDI QIDQ387306FDOQ387306

Authors Alain Billionnet, Fethi Jarray, Ghassen Tlig, Ezzedine Zagrouba

Publication date 20 December 2013

Published in Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-012-9193-5

zbMATH Keywords

integer programmingdiscrete tomographylinearizationconvexificationconvex binary matrices

Mathematics Subject Classification ID

Boolean and Hadamard matrices (15B34)

Recommendations

• Optimization and reconstruction of hv-convex (0,1)-matrices
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
• Reconstructing (0,1)-matrices from projections using integer programming
• Approximating hv-Convex Binary Matrices and Images from Discrete Projections
• A simulated annealing for reconstructing hv-convex binary matrices

Cites work

• scientific article; zbMATH DE number 3152649 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3335677 (Why is no real title available?)
• A benchmark set for the reconstruction of \(hv\)-convex discrete sets
• A calculus for the random generation of labelled combinatorial structures
• A framework for generating some discrete sets with disjoint components by using uniform distributions
• A theorem on flows in networks
• Approximating hv-Convex Binary Matrices and Images from Discrete Projections
• Characterization of Binary Patterns and Their Projections
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete tomography. Foundations, algorithms, and applications
• Extending the QCR method to general mixed-integer programs
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
• Polyominoes defined by two vectors
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of canonical \(hv\)-convex discrete sets from horizontal and vertical projections
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• Term rank of \(0,1\) matrices
• The reconstruction of binary patterns from their projections
• The reconstruction of polyominoes from their orthogonal projections
• Three-dimensional Statistical Data Security Problems

Cited in

(3)

• Reconstructing (0,1)-matrices from projections using integer programming
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
• Optimization and reconstruction of hv-convex (0,1)-matrices

This page was built for publication: Reconstructing convex matrices by integer programming approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387306)