| Article ID: | iaor20011522 |
| Country: | Netherlands |
| Volume: | 23 |
| Issue: | 1/2 |
| Start Page Number: | 13 |
| End Page Number: | 19 |
| Publication Date: | Aug 1998 |
| Journal: | Operations Research Letters |
| Authors: | Cheng E. |
| Keywords: | sets |
In this paper, we give a separation algorithm for a class of valid inequalities for cut polytopes and report the upper bound of the maximum cut problem obtained by separating over this class of inequalities in some computational experiments.