Pages that link to "Item:Q1904655"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655):
Displaying 8 items.
- A method for solving some optimization problems with bounds on variables (Q260512) (← links)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- Interval mathematics, algebraic equations and optimization (Q1593830) (← links)
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints (Q1850829) (← links)
- A hybrid genetic algorithm with the Baldwin effect (Q2269815) (← links)