A branch and bound algorithm for the capacitated vehicle routing problem (Q585095): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Gilbert Laporte / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C08 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 3829656 / rank
 
Normal rank
Property / zbMATH Keywords
 
capacitated vehicle routing
Property / zbMATH Keywords: capacitated vehicle routing / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound procedure
Property / zbMATH Keywords: branch and bound procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
capacity constraints
Property / zbMATH Keywords: capacity constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
exact solutions
Property / zbMATH Keywords: exact solutions / rank
 
Normal rank

Revision as of 18:42, 1 July 2023

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the capacitated vehicle routing problem
scientific article

    Statements

    A branch and bound algorithm for the capacitated vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    capacitated vehicle routing
    0 references
    branch and bound procedure
    0 references
    capacity constraints
    0 references
    exact solutions
    0 references

    Identifiers

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