|
|||||
|
|
Some new perspectives for solving 0–1 integer programming problems using Balas method |
|
| Authors: | Glover J Quan V Zolfaghari S |
| Institution: | 1.Department of Mechanical and Industrial Engineering, Ryerson University, 350 Victoria Street, Toronto, ON, M5B 2K3, Canada ;2.Department of Management, University of Toronto at Scarborough, 1265 Military Trail, Toronto, ON, M1C 1A4, Canada ;3.Department of Mechanical and Industrial Engineering, Ryerson University, 350 Victoria Street, Toronto, ON, M5B 2K3, Canada ; |
| Abstract: | Computational Management Science - Egon Balas’s additive algorithm, also known as implicit enumeration, is a technique that uses a branch-and-bound (B&B) approach to finding optimal... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |