An algorithm of internal feasible directions for linear integer programming (Q809890): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90081-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086440213 / rank | |||
Normal rank | |||
Revision as of 21:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm of internal feasible directions for linear integer programming |
scientific article |
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
