%0 Journal Article
	%A Divyesh Patel and  Tanuja Srivastava
	%D 2014
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 89, 2014
	%T Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing
	%U https://publications.waset.org/pdf/9998213
	%V 89
	%X This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

	%P 762 - 765