The following pages link to (Q4520756):
Displaying 5 items.
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- The small octagon with longest perimeter (Q857420) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
