Structure and Interpretation of Dual-Feasible Functions
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.
Category 1: Combinatorial Optimization (Other )
Category 2: Integer Programming (Cutting Plane Approaches )
Citation: 6 pages extended abstract to appear in Proc. LAGOS 2017, with 21 pages of appendix.
Entry Submitted: 06/13/2017
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|