A heuristic with tie breaking for certain 0–1 integer programming models (Q3731368)

From MaRDI portal
Revision as of 11:19, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A heuristic with tie breaking for certain 0–1 integer programming models
scientific article

    Statements

    title
    A heuristic with tie breaking for certain 0–1 integer programming models (English)
    0 references
    author
    G. Edward Fox
    0 references
    Gary D. Scudder
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    heuristic
    0 references
    0-1 integer linear programming
    0 references
    gradient-type rule
    0 references
    tie- breaking
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    90C09
    0 references
    65K05
    0 references
    zbMATH DE Number
    3963567
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3731368&oldid=17244258"
    Powered by MediaWiki