✦ LIBER ✦

A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms

✍ Scribed by Jordan Ninin; Frédéric Messine

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 330 KB
Volume: 50
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-010-9531-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Developing Interval Global Optimization

Developing Interval Global Optimization Algorithms on the Basis of Branch-and-Bound and Constraint Propagation Methods

✍ Yuri G. Dolgov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 606 KB

A branch-and-bound algorithm for the qua

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

✍ Peter Hahn; Thomas Grant; Nat Hall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 927 KB

On the convergence of two branch-and-bou

On the convergence of two branch-and-bound algorithms for nonconvex programming problems

✍ H. P. Benson 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 276 KB

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

The Adaptive Branch and Bound Method of

The Adaptive Branch and Bound Method of Tolerance Synthesis Based on the Reliability Index

✍ J. Deng; S. Deng 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 141 KB

A fast algorithm for a k-NN classifier b

A fast algorithm for a k-NN classifier based on the branch and bound method and computational quantity estimation

✍ Shin'ichiro Omachi; Hirotomo Aso 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 3 views

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the numb