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 ...
An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback