A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs
by Fred Glover, Hanif D. Sherali
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 3, 2007

Abstract: Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special classes of FP cuts, called balanced FP cuts and multi-level balanced FP cuts, and exhibit their relationship to special forms of disjunctive cuts. A numerical example illustrates the rich variety of cuts that can be generated.

Online publication date: Fri, 18-Apr-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com