Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (Q2892309): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58826439, #quickstatements; #temporary_batch_1719407511203 |
Created claim: DBLP publication ID (P1635): journals/informs/PisingerS07, #quickstatements; #temporary_batch_1735671842350 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.1060.0181 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.1060.0181 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/informs/PisingerS07 / rank | |||
Normal rank | |||
Latest revision as of 20:04, 31 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem |
scientific article |
Statements
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (English)
0 references
18 June 2012
0 references
integer programming
0 references
branch and bound
0 references
cutting plane
0 references
production-scheduling
0 references
cutting stock
0 references
