Maximizing the number of mixed packages subject to variety constraints (Q1819239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1819239 |
scientific article; zbMATH DE number 1385340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the number of mixed packages subject to variety constraints |
scientific article; zbMATH DE number 1385340 |
Statements
Maximizing the number of mixed packages subject to variety constraints (English)
0 references
5 January 2000
0 references
style goods
0 references
seasonal products
0 references
polynomial-time algorithm
0 references
one-dimensional bin-packing problem
0 references
pseudo-polynomial procedure
0 references
0.7793681621551514
0 references
0.7523924112319946
0 references
0.7481103539466858
0 references
0.7464627027511597
0 references
