Yet harder knapsack problems (Q653327): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2082847241
@@ Property / OpenAlex ID: W2082847241 / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of (generalized) OBDDs for threshold functions
+Normal rank
@@ Property / cites work @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+A stronger model of dynamic programming algorithms
+Normal rank
@@ Property / cites work @@
+A hard knapsack problem
@@ Property / cites work: A hard knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Size of ordered binary decision diagrams representing threshold functions
+Normal rank
@@ Property / cites work @@
+Simple lifted cover inequalities and hard knapsack problems
+Normal rank
@@ Property / cites work @@
+Trivial integer programs unsolvable by branch-and-bound
+Normal rank
@@ Property / cites work @@
+A note on read-$k$ times branching programs
@@ Property / cites work: A note on read-$k$ times branching programs / rank @@
+Normal rank
@@ Property / cites work @@
+Neither reading few bits twice nor reading illegally helps much
+Normal rank
@@ Property / cites work @@
+On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
+Normal rank
@@ Property / cites work @@
+Bounds on the size of branch-and-bound proofs for integer knapsacks
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank