A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme (Q4729613)
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:4729613 |
scientific article; zbMATH DE number 4114377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme |
scientific article; zbMATH DE number 4114377 |
Statements
A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme (English)
0 references
1989
0 references
aggregation
0 references
problem size estimation
0 references
set partitioning
0 references
computational results
0 references
0.7362449765205383
0 references
0.7067598700523376
0 references
0.6979730129241943
0 references
