| Article ID: | iaor20013426 |
| Country: | United States |
| Volume: | 37 |
| Issue: | 1/2 |
| Start Page Number: | 469 |
| End Page Number: | 472 |
| Publication Date: | Oct 1999 |
| Journal: | Computers & Industrial Engineering |
| Authors: | Knowles T.W. |
| Keywords: | programming: integer, programming: branch and bound |
Mixed Integer Linear Programming models are presented to develop a schedule for the mining of precious metal from available deposits. Alternate formulations and branch-and-bound search strategies are discussed. LINGO was used to build and solve the models.