The group-theoretic approach in mixed integer programming
From MaRDI portal
(Redirected from Publication:3565248)
Recommendations
Cited in
(23)- Standard pairs and group relaxations in integer programming
- Some cut-generating functions for second-order conic sets
- Aggregation-based cutting-planes for packing and covering integer programs
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
- On the complexity of surrogate and group relaxation for integer linear programs
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- A geometric approach to cut-generating functions
- Constrained infinite group relaxations of MIPs
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Numerical semigroups, polyhedra, and posets. I: The group cone
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- The structure of group relaxations
- Nonunique lifting of integer variables in minimal inequalities
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- The k-aggregation closure for covering sets
- Cutting planes for signomial programming
- Submodular maximization and its generalization through an intersection cut lens
- Alternative group relaxation of integer programming problems
This page was built for publication: The group-theoretic approach in mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565248)
