Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems (Q4766036)

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 3439996
Language Label Description Also known as
default for all languages
No label defined
    English
    Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
    scientific article; zbMATH DE number 3439996

      Statements

      Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems (English)
      0 references
      0 references
      0 references
      1974
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references