A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626): Difference between revisions

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ 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.endm.2010.05.079
+Normal rank
@@ Property / OpenAlex ID @@
+W2045625203
@@ Property / OpenAlex ID: W2045625203 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient cuts in Lagrangean `relax-and-cut' schemes
+Normal rank
@@ Property / cites work @@
+Q5294045
@@ Property / cites work: Q5294045 / rank @@
+Normal rank
@@ Property / cites work @@
+Non delayed relax-and-cut algorithms
@@ Property / cites work: Non delayed relax-and-cut algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3678962
@@ Property / cites work: Q3678962 / rank @@
+Normal rank
@@ Property / cites work @@
+Where are the hard knapsack problems?
@@ Property / cites work: Where are the hard knapsack problems? / rank @@
+Normal rank