A bounded dual (all-integer) integer programming algorithm with an objective cut (Q3316963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3847221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bounded dual (all-integer) integer programming algorithm with an objective cut |
scientific article; zbMATH DE number 3847221 |
Statements
A bounded dual (all-integer) integer programming algorithm with an objective cut (English)
0 references
1983
0 references
comparison of algorithms
0 references
convergence analysis
0 references
all integer cutting plane algorithm
0 references
integral upper bounds
0 references
Computational tests
0 references
0.8574758768081665
0 references
0.8328169584274292
0 references
0.7978360652923584
0 references
0.7974725365638733
0 references
