Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578)

From MaRDI portal
Revision as of 17:50, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7705480
Language Label Description Also known as
English
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
scientific article; zbMATH DE number 7705480

    Statements

    Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 July 2023
    0 references
    two-dimensional vector packing problem
    0 references
    time windows
    0 references
    hybrid method
    0 references
    branch-and-price-and-cut
    0 references
    adaptive large neighborhood search
    0 references

    Identifiers