Pages that link to "Item:Q2450751"
From MaRDI portal
The following pages link to Incremental and encoding formulations for mixed integer programming (Q2450751):
Displaying 15 items.
- Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques'' (Q463016) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- An optimization approach for winner determination problem considering transportation cost discounts (Q2046272) (← links)
- Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement (Q2164069) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Mixed-integer programming approaches for index tracking and enhanced indexation (Q2378489) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
