Pages that link to "Item:Q1904648"
From MaRDI portal
The following pages link to On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648):
Displayed 17 items.
- Experiments with range computations using extrapolation (Q858163) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) (← links)
- Parallel methods for verified global optimization practice and theory (Q1817314) (← links)
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- On the Asaithambi-Zuhe-Moore algorithm for computing the range of values (Q2460918) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- New results on verified global optimization (Q2564991) (← links)
- A new hybrid genetic algorithm for global optimization (Q4378896) (← links)
- Interval QFT: a mathematical and computational enhancement of QFT (Q4543686) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
- Lipschitz continuity and the termination of interval methods for global optimization (Q5948880) (← links)
