Pages that link to "Item:Q1416301"
From MaRDI portal
The following pages link to Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. (Q1416301):
Displayed 6 items.
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- DIRECT algorithm: A new definition of potentially optimal hyperrectangles (Q849791) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)