Pages that link to "Item:Q513173"

The following pages link to Relaxations and discretizations for the pooling problem (Q513173):

Displaying 28 items.

• A polynomially solvable case of the pooling problem (Q513170) (← links)
• New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
• Robust multicriteria risk-averse stochastic programming models (Q1698287) (← links)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
• Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
• A matheuristic approach for optimizing mineral value chains under uncertainty (Q2147943) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
• Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
• Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• Stochastic dual dynamic integer programming (Q2414913) (← links)
• Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
• A Bayesian framework for molecular strain identification from mixed diagnostic samples (Q4582733) (← links)
• Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
• Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← 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)
• Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)