| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652761 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
