Pages that link to "Item:Q411431"
From MaRDI portal
The following pages link to Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431):
Displaying 8 items.
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- Matrix methods for the tensorial Bernstein form (Q2008413) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- A hybrid artificial immune network for detecting communities in complex networks (Q2517303) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
