The group-theoretic approach in mixed integer programming

DOI10.1007/978-3-540-68279-0_19zbMATH Open1187.90004OpenAlexW85113592MaRDI QIDQ3565248FDOQ3565248

Authors Jean-Philippe Richard, Santanu S. Dey

Publication date 3 June 2010

Published in 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68279-0_19

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)

Recommendations

• The structure of group relaxations
• Constrained infinite group relaxations of MIPs
• A polyhedral study of the mixed integer cut
• Polyhedral approaches to mixed integer linear programming
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra

Cited in

(20)

• A geometric approach to cut-generating functions
• 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 structure of group relaxations
• Multiple cost coefficients sensitivity theorems of integer linear optimization
• Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case
• Standard pairs and group relaxations in integer programming
• Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
• Nonunique lifting of integer variables in minimal inequalities
• On the complexity of surrogate and group relaxation for integer linear programs
• Alternative group relaxation of integer programming problems
• Numerical semigroups, polyhedra, and posets. I: The group cone
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
• Aggregation-based cutting-planes for packing and covering integer programs
• Some cut-generating functions for second-order conic sets
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• Constrained infinite group relaxations of MIPs

Describes a project that uses

Uses Software

• MIPLIB
• FEASPUMP

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)