Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541): Difference between revisions

@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-blocking polyhedra
@@ Property / cites work: Anti-blocking polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q5685113
@@ Property / cites work: Q5685113 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of perfect graphs
@@ Property / cites work: A characterization of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01581034
+Normal rank
@@ Property / OpenAlex ID @@
+W2092751629
@@ Property / OpenAlex ID: W2092751629 / rank @@
+Normal rank