Reconstructing a binary matrix under timetabling constraints
From MaRDI portal
Recommendations
- Reconstructing binary matrices with timetabling constraints
- Reconstruction of binary matrices under adjacency constraints
- Reconstruction of binary matrices under adjacency constraints
- Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem
- Reconstruction of binary matrices under fixed size neighborhood constraints
- scientific article; zbMATH DE number 3928704
- Reconstructing binary matrices under window constraints from their row and column sums
- A greedy algorithm for reconstructing binary matrices with adjacent 1s
- A constraint-based approach to the timetabling problem
- The combinatorics of timetabling
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1551778 (Why is no real title available?)
- scientific article; zbMATH DE number 2086609 (Why is no real title available?)
- An algorithm reconstructing convex lattice sets.
- Discrete tomography. Foundations, algorithms, and applications
- Introduction to algorithms
- Reconstructing convex polyominoes from horizontal and vertical projections
- The reconstruction of polyominoes from their orthogonal projections
Cited in
(6)- A greedy algorithm for reconstructing binary matrices with adjacent 1s
- scientific article; zbMATH DE number 3928704 (Why is no real title available?)
- Reconstruction of binary matrices under adjacency constraints
- scientific article; zbMATH DE number 809139 (Why is no real title available?)
- Reconstructing binary matrices with timetabling constraints
- Reconstruction of binary matrices under adjacency constraints
This page was built for publication: Reconstructing a binary matrix under timetabling constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439178)