An advanced dual algorithm with constraint relaxation for all-integer programming (Q3671759)

From MaRDI portal
Revision as of 17:55, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An advanced dual algorithm with constraint relaxation for all-integer programming
scientific article

    Statements

    An advanced dual algorithm with constraint relaxation for all-integer programming (English)
    0 references
    0 references
    0 references
    1983
    0 references
    advanced dual algorithm
    0 references
    constraint relaxation
    0 references
    all-integer cutting plane algorithm
    0 references
    reduced advanced start algorithm
    0 references
    binding constraints
    0 references
    allocation problems
    0 references
    fixed-charge problems
    0 references
    branch and bound
    0 references
    computational experience
    0 references

    Identifiers