An algorithm of internal feasible directions for linear integer programming (Q809890)
From MaRDI portal
!
WARNING
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 4211807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm of internal feasible directions for linear integer programming |
scientific article; zbMATH DE number 4211807 |
Statements
An algorithm of internal feasible directions for linear integer programming (English)
0 references
1991
0 references
This is an approximate algorithm for solving pure integer linear programming problems. Starting with an arbitrarily chosen integer point as initial solution the algorithm then uses feasible integer directions with one or two nonzero components. The basic characteristics of the algorithm are analyzed, and it is compared with other approximate algorithms. Numerical results of tests on a personal computer are also reported.
0 references
approximate algorithm
0 references
pure integer linear programming
0 references
0.8397133946418762
0 references
