Updating a hybrid algorithm for set partitioning problems (Q3735467)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3968330
Language Label Description Also known as
default for all languages
No label defined
    English
    Updating a hybrid algorithm for set partitioning problems
    scientific article; zbMATH DE number 3968330

      Statements

      1985
      0 references
      heuristic algorithm
      0 references
      set partitioning
      0 references
      primal cutting plane algorithm
      0 references
      implicit enumeration algorithm
      0 references
      Computational results
      0 references
      Updating a hybrid algorithm for set partitioning problems (English)
      0 references
      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.
      0 references

      Identifiers