Pages that link to "Item:Q968007"
From MaRDI portal
The following pages link to Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007):
Displayed 14 items.
- A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
- On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
- Pareto-optimal front of cell formation problem in group technology (Q486727) (← links)
- P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
- A hybrid global optimization algorithm for nonlinear least squares regression (Q2392764) (← links)
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
- Branch and probability bound methods in multi-objective optimization (Q5963235) (← links)