Pages that link to "Item:Q3453340"

The following pages link to Analysis of MILP Techniques for the Pooling Problem (Q3453340):

Displaying 24 items.

• A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
• Pooling problems with polynomial-time algorithms (Q306403) (← links)
• A polynomially solvable case of the pooling problem (Q513170) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← 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)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• Solving certain complementarity problems in power markets via convex programming (Q2085814) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
• 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)
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← 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)
• Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544) (← links)
• Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
• Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• The computational complexity of the pooling problem (Q5964238) (← links)
• Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)