Pages that link to "Item:Q1322556"

The following pages link to Global minimization by reducing the duality gap (Q1322556):

Displaying 40 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)
• A cost minimization heuristic for the pooling problem (Q490199) (← 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)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Extended duality for nonlinear programming (Q707770) (← links)
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
• A new Lagrangean approach to the pooling problem (Q1037357) (← links)
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
• Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
• Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
• Integrated planning for design and production in two-stage recycling operations (Q1622807) (← 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)
• Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
• Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
• Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms (Q1848625) (← links)
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Decision-dependent probabilities in stochastic programs with recourse (Q1989722) (← links)
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← 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)
• Feasibility and cost minimisation for a lithium extraction problem (Q2289901) (← links)
• Natural gas production network infrastructure development under uncertainty (Q2358131) (← 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)
• Strong formulations for the pooling problem (Q2392127) (← links)
• On a decomposition method for nonconvex global optimization (Q2463828) (← links)
• On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
• On the effectiveness of sequential linear programming for the pooling problem (Q6103203) (← links)
• Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)
• Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)