A dynamic programming algorithm for the bilevel Knapsack problem (Q833584): Difference between revisions

@@ Property / cites work @@
+Bilevel programming: a survey
@@ Property / cites work: Bilevel programming: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Bilevel programming with knapsack constraints
@@ Property / cites work: Bilevel programming with knapsack constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Weak via strong Stackelberg problem: New results
@@ Property / cites work: Weak via strong Stackelberg problem: New results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3989989
@@ Property / cites work: Q3989989 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Foundations of bilevel programming
@@ Property / cites work: Foundations of bilevel programming / rank @@
+Normal rank