| Article ID: | iaor19982425 |
| Country: | Belgium |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 27 |
| End Page Number: | 41 |
| Publication Date: | Jan 1996 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Wilson J.M. |
| Keywords: | programming: assignment |
A recent development in (0–1) integer programming has been the use of logic cuts. These are cuts that can be derived from the logic of the integer programming model and although not binding on the LP relaxation optimal solution, do improve the traversal of the branch and bound tree. This note will demonstrate how logic cuts and other valid inequalities can be developed for and appended to certain standard (0–1) integer programs.