On the Value of Binary Expansions for General Mixed-Integer Linear Programs
From MaRDI portal
Publication:3635140
DOI10.1287/opre.50.5.810.370zbMath1163.90673OpenAlexW2141303179MaRDI QIDQ3635140
Sanjay Mehrotra, Jonathan H. Owen
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.50.5.810.370
Related Items
Binary extended formulations of polyhedral mixed-integer sets, A piecewise linearization for retail shelf space allocation problem and a local search heuristic, Stochastic dual dynamic integer programming, Integer programming solution approach for inventory‐production–distribution problems with direct shipments, Optimizing edge sets in networks to produce ground truth communities based on modularity, Cut generation through binarization, A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, Symmetric ILP: Coloring and small integers, Valid inequalities for mixed integer linear programs, Mixed Integer Linear Programming Formulation Techniques, Integer-programming software systems
