Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach
Copyright policy )Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Branch, Global Optimization, global optimization, Framework, Interval and finite arithmetic, Mixed-Integer Nonlinear Programming, Bernstein polynomials, Nonconvex programming, global optimization, Algorithm, Minlp, Bernstein Polynomials, Branch-And-Bound, Bounds, Mixed integer programming, Outer-Approximation, branch-and-bound, mixed-integer nonlinear programming, Form
Branch, Global Optimization, global optimization, Framework, Interval and finite arithmetic, Mixed-Integer Nonlinear Programming, Bernstein polynomials, Nonconvex programming, global optimization, Algorithm, Minlp, Bernstein Polynomials, Branch-And-Bound, Bounds, Mixed integer programming, Outer-Approximation, branch-and-bound, mixed-integer nonlinear programming, Form
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).22 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!