Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (Q5189096): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A typology of cutting and packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2712306 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:10, 2 July 2024
scientific article; zbMATH DE number 5678299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) |
scientific article; zbMATH DE number 5678299 |
Statements
Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (English)
0 references
6 March 2010
0 references
packing
0 references
cutting
0 references
pseudo-values
0 references
branch-and-bound method
0 references
0 references
