Reconstructing binary matrices with timetabling constraints

DOI10.1016/J.JDA.2016.07.001MaRDI QIDQ350725zbMATH OpenOpenAlexFDO

Authors Stefano Brocchi, Andrea Frosini, Srečko Brlek

Publication date 9 December 2016

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2016.07.001

zbMATH Keywords

computational complexitydiscrete tomographyscheduling problemreconstruction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computing methodologies for image processing (68U10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Reconstructing a binary matrix under timetabling constraints
• Reconstruction of binary matrices under fixed size neighborhood constraints
• A greedy algorithm for reconstructing binary matrices with adjacent 1s
• Reconstruction of binary matrices under adjacency constraints
• Reconstruction of binary matrices under adjacency constraints

Cites work

• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016640 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A THEOREM ON INDEPENDENCE RELATIONS
• A solvable case of image reconstruction in discrete tomography
• Combinatorial Properties of Matrices of Zeros and Ones
• Combinatorial matrix theory
• Complexity results for the horizontal bar packing problem
• Graph coloring with cardinality constraints on the neighborhoods
• Handbook on Scheduling
• Matroids and the greedy algorithm
• Network flows. Theory, algorithms, and applications.
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Project scheduling under limited resources. Models, methods, and applications
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
• Reconstruction of binary matrices under adjacency constraints
• Reconstruction of binary matrices under adjacency constraints
• Reconstruction of binary matrices under fixed size neighborhood constraints
• Solving the two color problem: an heuristic algorithm
• Survey, categorization, and comparison of recent tour scheduling literature
• Symbolic timing devices
• Using graphs for some discrete tomography problems

Cited in

(5)

• Reconstructing a binary matrix under timetabling constraints
• scientific article; zbMATH DE number 3928704 (Why is no real title available?)
• Reconstruction of binary matrices under adjacency constraints
• Condensing timetables with target date divisible by each instructor's number of class hours
• Some Results Concerning the Reduction of Binary Matrices

This page was built for publication: Reconstructing binary matrices with timetabling constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350725)