The min-conflict packing problem (Q1761135): Difference between revisions

@@ Property / describes a project that uses @@
+ParaDisEO
@@ Property / describes a project that uses: ParaDisEO / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / 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.cor.2011.10.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2083120958
@@ Property / OpenAlex ID: W2083120958 / rank @@
+Normal rank
@@ Property / cites work @@
+A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
+Normal rank
@@ Property / cites work @@
+Accelerating column generation for variable sized bin-packing problems
+Normal rank
@@ Property / cites work @@
+New lower bounds based on column generation and constraint programming for the pattern minimization problem
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition Principle for Linear Programs
@@ Property / cites work: Decomposition Principle for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Q4247468
@@ Property / cites work: Q4247468 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
+Normal rank
@@ Property / cites work @@
+An efficient tabu search approach for the 0-1 multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for time constrained scheduling
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+New lower bounds for bin packing problems with conflicts
+Normal rank
@@ Property / cites work @@
+Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1761135