Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (Q2892309): Difference between revisions

@@ Property / DOI @@
-.1287/ijoc.1060.0181
@@ Property / DOI: 10.1287/ijoc.1060.0181 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Algorithm 864
@@ Property / describes a project that uses: Algorithm 864 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ABACUS
@@ Property / describes a project that uses: ABACUS / 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.1287/ijoc.1060.0181
+Normal rank
@@ Property / OpenAlex ID @@
+W2140631835
@@ Property / OpenAlex ID: W2140631835 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58826439
@@ Property / Wikidata QID: Q58826439 / rank @@
+Normal rank
@@ Property / DOI @@
+.1287/IJOC.1060.0181
@@ Property / DOI: 10.1287/IJOC.1060.0181 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/informs/PisingerS07
@@ Property / DBLP publication ID: journals/informs/PisingerS07 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2892309