Article ID Journal Published Year Pages File Type
1143132 Operations Research Letters 2012 6 Pages PDF
Abstract
Dual feasible functions have been used to compute bounds and valid inequalities for combinatorial optimization problems. Here, we analyze the properties of some of the best functions proposed so far. Additionally, we provide new results for composed functions. These results will allow improving the computation of bounds and valid inequalities.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the extremality of maximal dual feasible functions
Authors
, , ,