A branch-and-cut algorithm for the hub location and routing problem (Q337094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650693 / rank
 
Normal rank
Property / zbMATH Keywords
 
hub location
Property / zbMATH Keywords: hub location / rank
 
Normal rank
Property / zbMATH Keywords
 
routing
Property / zbMATH Keywords: routing / rank
 
Normal rank
Property / zbMATH Keywords
 
valid inequalities
Property / zbMATH Keywords: valid inequalities / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank

Revision as of 05:22, 28 June 2023

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the hub location and routing problem
scientific article

    Statements

    A branch-and-cut algorithm for the hub location and routing problem (English)
    0 references
    10 November 2016
    0 references
    hub location
    0 references
    routing
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references

    Identifiers