A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676)

From MaRDI portal
Revision as of 20:47, 1 July 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
A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
scientific article

    Statements

    A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    swapping problem
    0 references
    robot arm travel
    0 references
    non-preemptive
    0 references
    capacitated
    0 references
    mathematical programming
    0 references
    branch-and-cut
    0 references

    Identifiers