Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
From MaRDI portal
Recommendations
- Using separation algorithms to generate mixed integer model reformulations
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Reformulations in Mathematical Programming: Definitions and Systematics
- Reformulation and decomposition of integer programs
- Formulations and Reformulations in Integer Programming
Cited in
(26)- An optimal multi-machine replacement policy in a serially dependent production system
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Network-based approximate linear programming for discrete optimization
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Uncapacitated two-level lot-sizing
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Capacity expansion with alternative technology choices
- Reformulations in Mathematical Programming: Definitions and Systematics
- Long range planning in the process industries: A projection approach
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Intermediate integer programming representations using value disjunctions
- MIP formulations and heuristics for two-level production-transportation problems
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Reformulation by discretization: application to economic lot sizing
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- A generalization of column generation to accelerate convergence
- A contraction for the multiparametric integer linear programming problem
- Gainfree Leontief substitution flow problems
- The splitting of variables and constraints in the formulation of integer programming models
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Progress with single-item lot-sizing
- Minimum concave cost flow over a grid network
This page was built for publication: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780007)
