On the Value of Binary Expansions for General Mixed-Integer Linear Programs
From MaRDI portal
Recommendations
Cited in
(20)- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- A generalized Benders decomposition approach for the optimal design of a local multi-energy system
- Valid inequalities for mixed integer linear programs
- Integer-programming software systems
- A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing
- Stochastic dual dynamic integer programming
- Binary extended formulations of polyhedral mixed-integer sets
- Optimizing edge sets in networks to produce ground truth communities based on modularity
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic
- Mixed integer linear programming formulation techniques
- Cut generation through binarization
- Binary extended formulations and sequential convexification
- Cut generation through binarization
- Symmetric ILP: Coloring and small integers
- Parsimonious binary-encoding in integer programming
- ``Binarize and project to generate cuts for general mixed-integer programs
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Encoding binary arithmetic operations in integer programming formulations
This page was built for publication: On the Value of Binary Expansions for General Mixed-Integer Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635140)
