Structure and Interpretation of Dual-Feasible Functions
classification
🧮 math.OC
keywords
functionsdual-feasibleautomaticclassicalcomputationcomputer-basedconversionextremality
read the original abstract
We study two techniques to obtain new families of classical and general Dual-Feasible Functions: A conversion from minimal Gomory--Johnson functions; and computer-based search using polyhedral computation and an automatic maximality and extremality test.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.