A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Heuristic algorithms for the multi-depot ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation Algorithms for the Capacitated m-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Latest revision as of 14:43, 3 July 2024

scientific article
Language Label Description Also known as
English
A heuristic procedure for the capacitated \(m\)-ring-star problem
scientific article

    Statements

    A heuristic procedure for the capacitated \(m\)-ring-star problem (English)
    0 references
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    capacitated \(m\)-ring-star problem
    0 references
    heuristic algorithms
    0 references
    networks
    0 references
    0 references