Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond

DOI10.1007/978-3-319-42432-3_35zbMath1434.68706arXiv1605.00197OpenAlexW2346911733MaRDI QIDQ2819232

Yuan Zhou, Chun Yu Hong, Matthias Köppe

Publication date: 28 September 2016

Published in: Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00197

zbMATH Keywords

integer programmingcutting planesgroup relaxations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Structure and interpretation of dual-feasible functions, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations

Uses Software

• SageMath
• infinite group relaxation
• GitHub

Cites Work

• Light on the infinite group relaxation. I: Foundations and taxonomy
• Valid inequalities for mips and group polyhedra from approximate liftings
• T-space and cutting planes
• An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
• Extreme functions with an arbitrary number of slopes
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
• Cut-Generating Functions and S-Free Sets
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited