Pages that link to "Item:Q3635140"
From MaRDI portal
The following pages link to On the Value of Binary Expansions for General Mixed-Integer Linear Programs (Q3635140):
Displaying 16 items.
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic (Q610971) (← links)
- Integer-programming software systems (Q817202) (← links)
- Cut generation through binarization (Q896284) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- Stochastic dual dynamic integer programming (Q2414913) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Parsimonious binary-encoding in integer programming (Q2581315) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Optimizing edge sets in networks to produce ground truth communities based on modularity (Q6066243) (← links)
- A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
- A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing (Q6164598) (← links)
