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):

Displaying 28 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)
• Theoretical rate of convergence for interval inclusion functions (Q695339) (← 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)
• LP-form inclusion functions for global optimization (Q1174536) (← links)
• Multidimensional bisection: A dual viewpoint (Q1324321) (← links)
• The cluster problem in multivariate global optimization (Q1338540) (← links)
• Numerical solution for bounding feasible point sets (Q1398432) (← links)
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests (Q1580430) (← links)
• A surprising approach in interval global optimization (Q1597637) (← links)
• Combining interval branch and bound and stochastic search (Q1725151) (← links)
• Optimal multisections in interval branch-and-bound methods of global optimization (Q1768626) (← links)
• An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
• On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← 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)
• (Q4885374) (← links)
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)