Teaching Integer Programming Formulations Using the Traveling Salesman Problem (Q4426333)

From MaRDI portal
Revision as of 16:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1982165
Language Label Description Also known as
English
Teaching Integer Programming Formulations Using the Traveling Salesman Problem
scientific article; zbMATH DE number 1982165

    Statements

    Teaching Integer Programming Formulations Using the Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    16 September 2003
    0 references
    integer programming
    0 references
    traveling salesman problem
    0 references
    subtour elimination constraints
    0 references
    cutting planes
    0 references

    Identifiers

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