Pages that link to "Item:Q4030783"
From MaRDI portal
The following pages link to Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem (Q4030783):
Displayed 10 items.
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Reasoning on infeasibility in distributed collaborative computing environment (Q1380446) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)