New concave penalty functions for improving the Feasibility Pump
Mixed-Integer optimization represents a powerful tool for modeling manyoptimization problems arising from real-world applications. The Feasibilitypump is a heuristic for finding feasible solutions to mixed integer linear problems. In this work, we propose a new feasibility pump approach using concave nondifferentiable penalty functions for measuring solution integrality. We present computational results on binary MILP problems from the MIPLIB library showing the effectiveness of our approach.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Phone: +390677274140|
Fax: +39 0677274129
Web page: http://www.dis.uniroma1.it
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Robert M. Saltzman & Frederick S. Hillier, 1992. "A Heuristic Ceiling Point Algorithm for General Integer Linear Programming," Management Science, INFORMS, vol. 38(2), pages 263-283, February.
When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2010-10. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi)
If references are entirely missing, you can add them using this form.