A survey of dual-feasible and superadditive functions


Dual-feasible functions are valuable tools that can be used to compute both lower bounds for different combinatorial problems and valid inequalities for integer programs. Several families of functions have been used in the literature. Some of them were defined explicitly, and others not. One of the main objectives of this paper is to survey these functions… (More)
DOI: 10.1007/s10479-008-0453-8


12 Figures and Tables