A note on the knapsack problem with special ordered sets (Q1168894): 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/0167-6377(81)90019-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2001472819
@@ Property / OpenAlex ID: W2001472819 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—A Note on Zero-One Programming
@@ Property / cites work: Technical Note—A Note on Zero-One Programming / rank @@
+Normal rank
@@ Property / cites work @@
+(1,k)-configurations and facets for packing problems
+Normal rank
@@ Property / cites work @@
+The Linear Multiple Choice Knapsack Problem
@@ Property / cites work: The Linear Multiple Choice Knapsack Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1168894