Updating a hybrid algorithm for set partitioning problems

From MaRDI portal





The author proposes a heuristic algorithm for the set partitioning problem consisting of a combination of a primal cutting plane algorithm and an implicit enumeration algorithm applied to subproblems. The algorithm is a variation of one of Balas. Computational results are reported.











This page was built for publication: Updating a hybrid algorithm for set partitioning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735467)