Solving problems of discrete tomography application in workforce scheduling
From MaRDI portal
Publication:2507504
DOI10.1007/s10288-005-0072-zzbMath1101.90356OpenAlexW208328010MaRDI QIDQ2507504
Publication date: 11 October 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0072-z
Computing methodologies for image processing (68U10) Deterministic scheduling theory in operations research (90B35) Polyominoes (05B50) Combinatorial complexity of geometric structures (52C45)
Related Items
Approximating Bicolored Images from Discrete Projections, Complexity results for the horizontal bar packing problem, Approximating hv-Convex Binary Matrices and Images from Discrete Projections