Worst‐case analysis of maximal dual feasible functions

Worst‐case analysis of maximal dual feasible functions

0.00 Avg rating0 Votes
Article ID: iaor20127292
Volume: 6
Issue: 8
Start Page Number: 1687
End Page Number: 1705
Publication Date: Dec 2012
Journal: Optimization Letters
Authors: , ,
Keywords: programming: linear
Abstract:

Dual feasible functions have been used to compute fast lower bounds and valid inequalities for integer linear problems. In this paper, we analyze the worst‐case performance of the lower bounds provided by some of the best functions proposed in the literature. We describe some worst‐case examples for these functions, and we report on new results concerning the best parameter choice for one of these functions.

Reviews

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