The following pages link to (Q5306655):
Displaying 44 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)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A system to evaluate gas network capacities: concepts and implementation (Q723970) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← 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)
- Linepack planning models for gas transmission network under uncertainty (Q1754369) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← 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)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (Q2294075) (← links)
- Impact of compressor failures on gas transmission network capability (Q2295182) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks (Q2331358) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- Joint optimization of pricing and planning decisions in divergent supply chain (Q2865167) (← links)
- A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem (Q4030783) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- A model approach to include wood properties in log sorting and transportation planning (Q5879662) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- On the effectiveness of sequential linear programming for the pooling problem (Q6103203) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
