Pages that link to "Item:Q2010087"
From MaRDI portal
The following pages link to Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087):
Displaying 6 items.
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)