A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307)

From MaRDI portal
Revision as of 00:06, 3 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 221875
Language Label Description Also known as
English
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
scientific article; zbMATH DE number 221875

    Statements

    A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman
    0 references
    feasible minimum cost Hamiltonian path
    0 references
    precedence constraints
    0 references
    branch-and-cut algorithms
    0 references