Alternative group relaxation of integer programming problems (Q794928): Difference between revisions
From MaRDI portal
Latest revision as of 13:09, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternative group relaxation of integer programming problems |
scientific article |
Statements
Alternative group relaxation of integer programming problems (English)
0 references
1984
0 references
The paper is devoted to some questions of integer problems relaxation to group problems and the complexity of the group solution algorithms. Some algorithms for exact and approximate solution of IP problems over a cone are proposed. One of the approximate algorithms is with a given level of accuracy. Numerical results are given.
0 references
complexity of solution algorithms
0 references
relaxation
0 references
group problems
0 references
approximate algorithms
0 references
Numerical results
0 references
0 references
0 references
