Pages that link to "Item:Q3780007"
From MaRDI portal
The following pages link to Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition (Q3780007):
Displaying 27 items.
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Uncapacitated two-level lot-sizing (Q991455) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- A contraction for the multiparametric integer linear programming problem (Q1278945) (← links)
- Capacity expansion with alternative technology choices (Q1333530) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- Long range planning in the process industries: A projection approach (Q1919201) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- An optimal multi-machine replacement policy in a serially dependent production system (Q4394382) (← links)
- A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729) (← links)
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
