Pages that link to "Item:Q1583690"

The following pages link to Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (Q1583690):

Displayed 14 items.

• A new multi-section based technique for constrained optimization problems with interval-valued objective function (Q275782) ‎ (← links)
• On constrained optimization by interval arithmetic and interval order relations (Q505105) ‎ (← links)
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) ‎ (← links)
• The big cube small cube solution method for multidimensional facility location problems (Q733529) ‎ (← links)
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) ‎ (← 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)
• Numerical solution for bounding feasible point sets (Q1398432) ‎ (← 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)
• A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) ‎ (← links)
• An efficient interval computing technique for bound-constrained uncertain optimization problems (Q2926481) ‎ (← links)
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) ‎ (← links)