Pages that link to "Item:Q2182860"
From MaRDI portal
The following pages link to Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860):
Displayed 4 items.
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)