A simulated annealing for reconstructing hv-convex binary matrices
From MaRDI portal
Publication:2883593
DOI10.1016/J.ENDM.2010.05.057zbMATH Open1237.90262OpenAlexW1984351218MaRDI QIDQ2883593FDOQ2883593
Authors: Fethi Jarray, Ghassen Tlig 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.057
Recommendations
- Approximating hv-Convex Binary Matrices and Images from Discrete Projections
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Optimization and reconstruction of hv-convex (0,1)-matrices
- An empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Discrete tomography. Foundations, algorithms, and applications
- A theorem on flows in networks
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Reconstructing convex polyominoes from horizontal and vertical projections
- Combinatorial Properties of Matrices of Zeros and Ones
- The reconstruction of polyominoes from their orthogonal projections
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Approximating hv-Convex Binary Matrices and Images from Discrete Projections
Cited In (4)
This page was built for publication: A simulated annealing for reconstructing hv-convex binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883593)
