We present an algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm ...
Let $S_k$ be the set of positive integers containing no arithmetic progression of $k$ terms, generated by the greedy algorithm. A heuristic formula, supported by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback