haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 108 / 544
| Tekijä: | Ashford, R. W. Daniel, R. C. |
| Otsikko: | Some lessons in solving practical integer programs |
| Lehti: | Journal of the Operational Research Society
1992 : MAY, VOL. 43:5, p. 425-433 |
| Asiasana: | INTEGER PROGRAMMING LINEAR PROGRAMMING MODELS MATHEMATICAL MODELS |
| Kieli: | eng |
| Tiivistelmä: | Integer programs (even those of modest size) are harder to solve than linear programs of similar size. However, formulated with care and solved with an appropriate branching strategy, they may be solved quickly. Elements of good formulation, high level branching constructs and effective branching strategies are discussed in the paper. Four practical integer programming models are examined with a view to elucidating what makes formulations good. Each model is of fairly modest size, but none is particularly easy to solve. |
SCIMA