Implicit enumeration algorithms for the set-partitioning problem
From MaRDI portal
Publication:1143941
DOI10.1007/BF01720155zbMath0442.90059MaRDI QIDQ1143941
Publication date: 1980
Published in: OR Spektrum (Search for Journal in Brave)
set-partitioning problem; comparison of algorithms; computational experiences; branch-and-bound concept; column enumeration algorithm; implicit enumeration algorithms; lower bound concept; preordering of the variables
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C09: Boolean programming