A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249): Difference between revisions

@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Lagrangean methods for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+On the supermodular knapsack problem
@@ Property / cites work: On the supermodular knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cuts and related problems
@@ Property / cites work: Minimum cuts and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Selection Problem of Shared Fixed Costs and Network Flows
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank