Reconstructing convex matrices by integer programming approaches
From MaRDI portal
Publication:387306
DOI10.1007/s10852-012-9193-5zbMath1280.65040OpenAlexW1964092208MaRDI QIDQ387306
Ghassen Tlig, Ezzedine Zagrouba, Fethi Jarray, Alain Billionnet
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending the QCR method to general mixed-integer programs
- Reconstructing convex polyominoes from horizontal and vertical projections
- A theorem on flows in networks
- Term rank of \(0,1\) matrices
- 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
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Switching components and the ambiguity problem in the reconstruction of pictures from their projections
- Polyominoes defined by two vectors
- A calculus for the random generation of labelled combinatorial structures
- Discrete tomography. Foundations, algorithms, and applications
- The reconstruction of polyominoes from their orthogonal projections
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Combinatorial Properties of Matrices of Zeros and Ones
- Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Characterization of Binary Patterns and Their Projections
- Three-dimensional Statistical Data Security Problems
- Approximating hv-Convex Binary Matrices and Images from Discrete Projections
- The reconstruction of binary patterns from their projections
