Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771)
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: Estimation of the number of iterations in integer programming algorithms using the regular partitions method |
scientific article; zbMATH DE number 6357745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimation of the number of iterations in integer programming algorithms using the regular partitions method |
scientific article; zbMATH DE number 6357745 |
Statements
Estimation of the number of iterations in integer programming algorithms using the regular partitions method (English)
0 references
17 October 2014
0 references
discrete optimization
0 references
integer programming
0 references
regular partitions method
0 references
estimates of the number of iterations
0 references
cuts
0 references
\(L\)-class enumeration
0 references
branch and bound method
0 references
estimates on average
0 references
stability of algorithms
0 references
0 references
0 references
0 references
0 references
0.8366314172744751
0 references
0.8261209726333618
0 references
0.8182957172393799
0 references
