Improving branch-and-bound methods for discrete problems with Boolean variables

MaRDI QIDQ755318zbMATH OpenFDO

Authors Vitali Oscarovich Groppen

Publication date 1978

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

algorithmslinear programmingefficiencyknapsack problembranch-and-bound methodscombinatorial problems with Boolean variables

Mathematics Subject Classification ID

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)