Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944): 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/j.cor.2010.07.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1976513369
@@ Property / OpenAlex ID: W1976513369 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Dimensional Finite Bin-Packing Algorithms
@@ Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An analytical model for the container loading problem
+Normal rank
@@ Property / cites work @@
+A new constraint programming approach for the orthogonal packing problem
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-dimensional packing with conflicts
@@ Property / cites work: Two-dimensional packing with conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+Q4247468
@@ Property / cites work: Q4247468 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient tabu search approach for the 0-1 multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4875172
@@ Property / cites work: Q4875172 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for time constrained scheduling
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+New lower bounds for bin packing problems with conflicts
+Normal rank
@@ Property / cites work @@
+Two-dimensional packing problems: a survey
@@ Property / cites work: Two-dimensional packing problems: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+An exact method for graph coloring
@@ Property / cites work: An exact method for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Two-Dimensional Finite Bin Packing Problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q5687257
@@ Property / cites work: Q5687257 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+An introduction to timetabling
@@ Property / cites work: An introduction to timetabling / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank