Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Some polyhedra related to combinatorial problems
@@ Property / cites work: Some polyhedra related to combinatorial problems / rank @@
+Normal rank
@@ Property / cites work @@
+When the Greedy Solution Solves a Class of Knapsack Problems
+Normal rank
@@ Property / cites work @@
+The cutting stock problem and integer rounding
@@ Property / cites work: The cutting stock problem and integer rounding / rank @@
+Normal rank
@@ Property / cites work @@
+Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(95)90600-k
+Normal rank
@@ Property / OpenAlex ID @@
+W2009082978
@@ Property / OpenAlex ID: W2009082978 / rank @@
+Normal rank