Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:52, 8 February 2024

scientific article; zbMATH DE number 7360285
Language Label Description Also known as
English
Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
scientific article; zbMATH DE number 7360285

    Statements

    Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (English)
    0 references
    17 June 2021
    0 references
    branch-and-cut
    0 references
    valid inequalities
    0 references
    asymmetric
    0 references
    multidepot
    0 references
    vehicle routing
    0 references
    upper-bound procedure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references