Pages that link to "Item:Q952456"
From MaRDI portal
The following pages link to Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456):
Displaying 15 items.
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
- Binary matrices under the microscope: A tomographical problem (Q868951) (← links)
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints (Q952460) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- Exact and heuristic algorithms for data sets reconstruction (Q1576347) (← links)
- Binary image reconstruction based on prescribed numerical information (Q2355370) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- (Q3096201) (← links)
- Reconstructing a binary matrix under timetabling constraints (Q3439178) (← links)
- Reconstruction of binary matrices under adjacency constraints (Q3439193) (← links)
- Solving Some Instances of the 2-Color Problem (Q3648811) (← links)
- Theoretical Computer Science (Q5395070) (← links)
- On the use of graphs in discrete tomography (Q5900257) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)