Reconstructing binary matrices with timetabling constraints (Q350725): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2016.07.001
@@ Property / DOI: 10.1016/j.jda.2016.07.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Survey, categorization, and comparison of recent tour scheduling literature
+Normal rank
@@ Property / cites work @@
+Solving the Two Color Problem: An Heuristic Algorithm
+Normal rank
@@ Property / cites work @@
+Symbolic timing devices
@@ Property / cites work: Symbolic timing devices / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook on Scheduling
@@ Property / cites work: Handbook on Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of binary matrices under fixed size neighborhood constraints
+Normal rank
@@ Property / cites work @@
+Q3998725
@@ Property / cites work: Q3998725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5434302
@@ Property / cites work: Q5434302 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131987
@@ Property / cites work: Q4131987 / rank @@
+Normal rank
@@ Property / cites work @@
+Using graphs for some discrete tomography problems
+Normal rank
@@ Property / cites work @@
+Graph coloring with cardinality constraints on the neighborhoods
+Normal rank
@@ Property / cites work @@
+A solvable case of image reconstruction in discrete tomography
+Normal rank
@@ Property / cites work @@
+Reconstruction of binary matrices under adjacency constraints
+Normal rank
@@ Property / cites work @@
+Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Project scheduling under limited resources. Models, methods, and applications
+Normal rank
@@ Property / cites work @@
+Complexity results for the horizontal bar packing problem
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4338954
@@ Property / cites work: Q4338954 / rank @@
+Normal rank
@@ Property / cites work @@
+A THEOREM ON INDEPENDENCE RELATIONS
@@ Property / cites work: A THEOREM ON INDEPENDENCE RELATIONS / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Properties of Matrices of Zeros and                         Ones
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2016.07.001
@@ Property / DOI: 10.1016/J.JDA.2016.07.001 / rank @@
+Normal rank