Group-Theoretic Results in Mixed Integer Programming
From MaRDI portal
Cited in
(6)- The b-hull of an integer program
- Representations of unbounded optimization problems as integer programs
- Cutting-plane theory: Algebraic methods
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Computational experience with a group theoretic integer programming algorithm
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
This page was built for publication: Group-Theoretic Results in Mixed Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640998)