The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097)

From MaRDI portal
Revision as of 23:07, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58116978, #quickstatements; #temporary_batch_1704836857466)
scientific article
Language Label Description Also known as
English
The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
scientific article

    Statements

    The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    vehicle routing
    0 references
    Capacitated Chinese Postman Problem
    0 references
    NP-hard
    0 references
    matching- based lower bound
    0 references

    Identifiers