✦ LIBER ✦

On integer solutions to quadratic programs by a branch and bound technique

✍ Scribed by S. C. Agrawal

Book ID: 112975494
Publisher: Springer-Verlag
Year: 1974
Weight: 221 KB
Volume: 25
Category: Article
ISSN: 0041-0241
DOI: 10.1007/bf03030151

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An alternate method on integer solutions

An alternate method on integer solutions to quadratic programs by a branch and bound technique

✍ S. C. Agrawal 📂 Article 📅 1976 🏛 Springer-Verlag ⚖ 276 KB

A note on integer solutions to linear fr

A note on integer solutions to linear fractional interval programming problems by a branch & bound technique

✍ S. C. Agrawal; Mam Chand 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB

An efficient branch and bound algorithm

An efficient branch and bound algorithm to solve the quadratic integer programming problem

✍ F. Körner 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 333 KB

A simple, all primal branch and bound ap

A simple, all primal branch and bound approach to pure and mixed integer binary programs

✍ Gary A. Kochenberger; Victor H. Richard 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Computational aspects of a branch and bo

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

✍ P. M. Pardalos; G. P. Rodgers 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 712 KB

A parallel branch-and-bound algorithm fo

A parallel branch-and-bound algorithm for integer linear programming and its implementation on a distributed multiprocessor

✍ Atsuko Ikegami; Katsuhiro Aoyagi; Hajime Iizuka 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 830 KB

## Abstract This paper describes a parallel branch‐and‐bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2. With a branch‐and‐bound algorithm, the amount of computation on each search tree node varies, and in general,