Foundation-penalty cuts for mixed-integer programs

Foundation-penalty cuts for mixed-integer programs

0.00 Avg rating0 Votes
Article ID: iaor20032983
Country: Netherlands
Volume: 31
Issue: 4
Start Page Number: 245
End Page Number: 253
Publication Date: Jul 2003
Journal: Operations Research Letters
Authors: ,
Keywords: cutting plane algorithms
Abstract:

We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to generate by exploiting routine penalty calculations. Their underlying concept generalizes the lifting process and provides derivations of major classical cuts. (Gomory cuts arise from low level FP cuts by simply ‘plugging in’ standard penalties.)

Reviews

Required fields are marked *. Your email address will not be published.