A branch and cut algorithm for hub location problems with single assignment (Q1771311)

From MaRDI portal
Revision as of 04:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A branch and cut algorithm for hub location problems with single assignment
scientific article

    Statements

    A branch and cut algorithm for hub location problems with single assignment (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2005
    0 references
    Hub location
    0 references
    Polyhedral analysis
    0 references
    Branch and cut
    0 references
    0 references
    0 references

    Identifiers