✦ LIBER ✦

A graphics based computer-aided learning package for integer programming: The branch and bound algorithm

✍ Scribed by K.V. Ramani; T.P.Rama Rao

Book ID: 118407812
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 476 KB
Volume: 23
Category: Article
ISSN: 0360-1315
DOI: 10.1016/0360-1315(94)90014-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving the efficiency of the Branch a

Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information

✍ Iván Derpich; Jorge R. Vera 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A new branching rule for the branch and

A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems

✍ Frank Körner 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 374 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

Branch-and-Bound Variant of an Outcome-B

Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem

✍ J. Fülöp; L. D. Muu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 118 KB