Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems (Q5960735)

From MaRDI portal
Revision as of 09:20, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1729461
Language Label Description Also known as
English
Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
scientific article; zbMATH DE number 1729461

    Statements

    Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems (English)
    0 references
    0 references
    0 references
    0 references
    2001
    0 references
    branch and bound
    0 references
    genetic algorithm
    0 references
    maximum satisfiability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references