New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem Published: 2015/05/29, Updated: 2016/10/01 Matthias KöppeYuan ZhouCategories (Mixed) Integer Linear Programming, Cutting Plane Approaches Tags cut generating functions, group relaxation, integer programming Short URL: https://optimization-online.org/?p=13440 We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions. ArticleDownload View PDF