𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Operations Research and Cyber-Infrastructure || A Branch-and-cut Algorithm for Integer Bilevel Linear Programs

✍ Scribed by Chinneck, John W.; Kristjansson, Bjarni; Saltzman, Matthew J.


Book ID
120443542
Publisher
Springer US
Year
2009
Weight
400 KB
Category
Article
ISBN
0387888438

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A parallel branch-and-bound algorithm fo
✍ 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,