Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond
From MaRDI portal
Publication:2819232
Abstract: We present software for investigations with cut generating functions in the Gomory-Johnson model and extensions, implemented in the computer algebra system SageMath.
Cites work
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- Cut-generating functions and \(S\)-free sets
- 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
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- T-space and cutting planes
- Valid inequalities for mips and group polyhedra from approximate liftings
Cited in
(4)- 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
- Structure and interpretation of dual-feasible functions
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
This page was built for publication: Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819232)