Comparison of an exact branch-and-bound and an approximative evolutionary algorithm for the probabilistic traveling salesman problem (Q4494413)

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 1487884
Language Label Description Also known as
default for all languages
No label defined
    English
    Comparison of an exact branch-and-bound and an approximative evolutionary algorithm for the probabilistic traveling salesman problem
    scientific article; zbMATH DE number 1487884

      Statements

      4 January 2001
      0 references
      Comparison of an exact branch-and-bound and an approximative evolutionary algorithm for the probabilistic traveling salesman problem (English)
      0 references
      0 references

      Identifiers