| Article ID: | iaor1990710 |
| Country: | United Kingdom |
| Volume: | 28 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Mar 1988 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Perepelitsa V.A., Sergienko I.V. |
The multicriterion multi-index problem of integer linear programming is considered and polynomial approximate algorithms are proposed for solving it; one of these algorithms is asymptotically exact. The computational complexity of the problem and its solvability in the class of algorithms with linear convolution of the criteria are investigated.