Combining Interval Branch and Bound and Stochastic Search
نویسندگان
چکیده
منابع مشابه
Resolution Search and Dynamic Branch-and-Bound
A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (l997) as an alternative to implicit enumeration, with a demonstration that the method can yield more effective branching strategies. We show that an earlier method called Dynamic Branch-and-Bound (DB&B), due to Glover and Tangedahl (1976), yields the same branching strategies as Reso...
متن کاملMultiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The framework is based on a multiscale representation of both the image data, and the associated parameter space that must be searched. We define a general form for the distance function which insures that branch and bound sea...
متن کاملReplicable parallel branch and bound search
Combinatorial branch and bound searches are a common technique for solving global optimisation and decisionproblems. Their performance oftendepends on good search order heuristics, refined over decades of algorithms research. Parallel search necessarily deviates from the sequential search order, sometimes dramatically and unpredictably, e.g. by distributing work at random. This can disrupt effe...
متن کاملPreprocessing Search Spaces for Branch and Bound Search
Heurist ic search procedures are useful in a large number of problems of pract ica l impor tance . Such procedures operate by searching several paths in a search space at the same t i m e , expand ing some paths more qu ick ly t han others depending on which paths look most promising. Of ten large amounts of t ime are required in keeping track of the contro l knowledge. For some problems, th is...
متن کاملTools for Simplicial Branch and Bound in Interval Global Optimization∗
Most branch and bound (B&B) algorithms for continuous global optimization work with hyper-rectangles, although some work in the 1970’s dealt with simplexes. More recently, Žilinskas et al have considered branch and bound for Lipschitz optimization, giving examples of how symmetry can be used and how algorithms can be made efficient. Here, in the spirit of that work, we consider simplex-based br...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/861765