Pages that link to "Item:Q1580430"
From MaRDI portal
The following pages link to Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests (Q1580430):
Displayed 13 items.
- A new multi-section based technique for constrained optimization problems with interval-valued objective function (Q275782) (← links)
- Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
- On constrained optimization by interval arithmetic and interval order relations (Q505105) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- Interval oriented multi-section techniques for global optimization (Q1002180) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- Combining interval branch and bound and stochastic search (Q1725151) (← links)
- Use of an interval global optimization tool for exploring feasibility of batch extractive distillation (Q2460135) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- A new pruning test for finding all global minimizers of nonsmooth functions (Q2572719) (← links)
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context (Q2572918) (← links)
- An efficient interval computing technique for bound-constrained uncertain optimization problems (Q2926481) (← links)