Simple lifted cover inequalities and hard knapsack problems (Q2581317): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2005.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2032140426
@@ Property / OpenAlex ID: W2032140426 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737524
@@ Property / cites work: Q4737524 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Trivial integer programs unsolvable by branch-and-bound
+Normal rank
@@ Property / cites work @@
+The complexity of cover inequality separation
@@ Property / cites work: The complexity of cover inequality separation / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence of stochastic processes
@@ Property / cites work: Convergence of stochastic processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank