Properties of some ILP formulations of a class of partitioning problems (Q1270767): Difference between revisions

@@ Property / cites work @@
+Lower bounds and algorithms for the 2-dimensional vector packing problem
+Normal rank
@@ Property / cites work @@
+Q3351135
@@ Property / cites work: Q3351135 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Scheduling of Tasks on Identical Parallel Processors
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case comparison of valid inequalities for the TSP
+Normal rank
@@ Property / cites work @@
+The strongest facets of the acyclic subgraph polytope are unknown
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the dual bin packing problem
+Normal rank
@@ Property / cites work @@
+A comparison of two edge-coloring formulations
@@ Property / cites work: A comparison of two edge-coloring formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds and reduction procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Solving binary cutting stock problems by column generation and branch- and-bound
+Normal rank