| Article ID: | iaor1995328 |
| Country: | Bulgaria |
| Volume: | 20 |
| Issue: | 1 |
| Start Page Number: | 74 |
| End Page Number: | 82 |
| Publication Date: | Aug 1994 |
| Journal: | Serdica |
| Authors: | Tzokov V. |
| Keywords: | heuristics |
The Min-Max form of the Multiple-Choice Problem is considered in this paper. An heuristic algorithm based on some heuristic strategies and information from the last simplex tableau of the Linear Programming Relaxation is given. The results of computational experiments are presented.