Pages that link to "Item:Q2568640"
From MaRDI portal
The following pages link to Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods (Q2568640):
Displaying 17 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Optimization problems with interval uncertainty: branch and bound method (Q465982) (← links)
- Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- An interval branch and bound algorithm for bound constrained optimization problems (Q1200632) (← links)
- A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
- A surprising approach in interval global optimization (Q1597637) (← links)
- Improving interval analysis bounds by translations (Q1888143) (← links)
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
- An interval branch and bound method for global robust optimization (Q2046260) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems (Q2568646) (← links)
- An intlab based global optimization method and its application to a sensor network localization problem (Q2859449) (← links)
- ICOS: a branch and bound based solver for rigorous global optimization (Q3396393) (← links)
- Global Optimization and Constraint Satisfaction (Q5897044) (← links)
