Improving branch-and-bound methods for discrete problems with Boolean variables
zbMATH Open0417.68055MaRDI QIDQ755318FDOQ755318
Publication date: 1978
Published in: Automation and Remote Control (Search for Journal in Brave)
algorithmslinear programmingefficiencyknapsack problembranch-and-bound methodscombinatorial problems with Boolean variables
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Boolean programming (90C09) Algorithms in computer science (68W99)
This page was built for publication: Improving branch-and-bound methods for discrete problems with Boolean variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755318)
