Integer linear programming formulations of the filter partitioning minimization problem (Q782755): Difference between revisions

@@ Property / cites work @@
+Cliques, holes and the vertex coloring polytope
@@ Property / cites work: Cliques, holes and the vertex coloring polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On the asymmetric representatives formulation for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Orienting polygonal parts without sensors
@@ Property / cites work: Orienting polygonal parts without sensors / rank @@
+Normal rank
@@ Property / cites work @@
+New integer linear programming models for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Planning Algorithms
@@ Property / cites work: Planning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Robust bayesian estimation for the linear model and robustifying the Kalman filter
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for graph coloring
@@ Property / cites work: A cutting plane algorithm for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
+Normal rank
@@ Property / cites work @@
+Graph Coloring Lower Bounds from Decision Diagrams
+Normal rank