Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6389164 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bin packing | |||
| Property / zbMATH Keywords: bin packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
column generation | |||
| Property / zbMATH Keywords: column generation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch-and-price | |||
| Property / zbMATH Keywords: branch-and-price / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
beam search | |||
| Property / zbMATH Keywords: beam search / rank | |||
Normal rank | |||
Revision as of 22:33, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items |
scientific article |
Statements
Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (English)
0 references
22 January 2015
0 references
bin packing
0 references
column generation
0 references
branch-and-price
0 references
beam search
0 references
