A bounded dual (all-integer) integer programming algorithm with an objective cut (Q3316963): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:48, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bounded dual (all-integer) integer programming algorithm with an objective cut |
scientific article |
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
