An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317)

From MaRDI portal
Revision as of 17:53, 19 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 Additive Bounding Procedure for Combinatorial Optimization Problems
scientific article

    Statements

    An Additive Bounding Procedure for Combinatorial Optimization Problems (English)
    0 references
    0 references
    0 references
    1989
    0 references
    branch-and-bound
    0 references
    linear objective function
    0 references
    lower bounds
    0 references
    traveling salesman
    0 references
    precedence constraints
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references