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

From MaRDI portal
Revision as of 14:30, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A heuristic with tie breaking for certain 0–1 integer programming models
scientific article

    Statements

    A heuristic with tie breaking for certain 0–1 integer programming models (English)
    0 references
    0 references
    0 references
    1985
    0 references
    heuristic
    0 references
    0-1 integer linear programming
    0 references
    gradient-type rule
    0 references
    tie- breaking
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references