Pages that link to "Item:Q3009755"
From MaRDI portal
The following pages link to Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755):
Displaying 16 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- A sufficient condition for pooling data (Q935026) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Optimization and sustainable development (Q2355714) (← links)
- Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
