The study of integer partitions has a long and storied history, notably beginning with the pioneering work of Hardy and Ramanujan, and continues to be enriched by modern asymptotic techniques. Recent ...
An algorithm is presented for the special integer linear program known as the set partitioning problem. This problem has a binary coefficient matrix, binary variables, and unit resources. Furthermore, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback