Abstract
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of cut-generating functions is explored. We find the characterization of (restricted/strongly) maximal general DFFs and prove a 2-slope theorem for extreme general DFFs. We show that any restricted maximal general DFF can be well approximated by an extreme general DFF.
Author supplied keywords
Cite
CITATION STYLE
Köppe, M., & Wang, J. (2018). Characterization and approximation of strong general dual feasible functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10856 LNCS, pp. 265–276). Springer Verlag. https://doi.org/10.1007/978-3-319-96151-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
