Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach (Q3037137)

From MaRDI portal
Revision as of 20:53, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
scientific article

    Statements

    Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach (English)
    0 references
    0 references
    0 references
    1983
    0 references
    generalized travelling salesman problem
    0 references
    shortest Hamiltonian cycle
    0 references
    integer linear program
    0 references
    degree constraints
    0 references
    subtour elimination
    0 references
    branch and bound algorithm
    0 references
    computational results
    0 references

    Identifiers

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