Pages that link to "Item:Q3114904"

The following pages link to Pooling Problem: Alternate Formulations and Solution Methods (Q3114904):

Displaying 42 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)
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
• General variable neighborhood search for the continuous optimization (Q932193) (← links)
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• A new Lagrangean approach to the pooling problem (Q1037357) (← links)
• Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
• Integrated planning for design and production in two-stage recycling operations (Q1622807) (← 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)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
• Cyclic seesaw process for optimization and identification (Q1762401) (← 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)
• Double-row facility layout with replicate machines and split flows (Q2003412) (← links)
• Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Feasibility and cost minimisation for a lithium extraction problem (Q2289901) (← links)
• Optimization and sustainable development (Q2355714) (← 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)
• 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)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← 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)
• The computational complexity of the pooling problem (Q5964238) (← links)
• A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)
• A strong P-formulation for global optimization of industrial water-using and treatment networks (Q6541385) (← links)