Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609)

From MaRDI portal
Revision as of 21:46, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1632044
Language Label Description Also known as
English
Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
scientific article; zbMATH DE number 1632044

    Statements

    Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2001
    0 references
    combinatorial optimization
    0 references
    polyhedra
    0 references
    branch-and-cut
    0 references

    Identifiers