Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-016-0431-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
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 method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-depot multiple TSP: a polyhedral study and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling 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: A comparison of several models for the hamiltonian <i>p</i>‐median 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: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for solving the ring star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood tabu search and its application to the median cycle problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-016-0431-7 / rank
 
Normal rank

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Multiple depot ring star problem: a polyhedral study and an exact algorithm
scientific article

    Statements

    Multiple depot ring star problem: a polyhedral study and an exact algorithm (English)
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    autonomous vehicles
    0 references
    data collection
    0 references
    telecommunications
    0 references
    resource allocation
    0 references
    branch-and-cut
    0 references
    polyhedral study
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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