Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an urban waste collection problem using ants heuristics / 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: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric generalized traveling salesman polytope / 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 efficient transformation of the generalized vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the 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: Q5578578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Generalized Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / 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: Q5563210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple depot ring star problem: a polyhedral study and an exact algorithm / rank
 
Normal rank

Latest revision as of 02:45, 16 July 2024

scientific article
Language Label Description Also known as
English
Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
scientific article

    Statements

    Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (English)
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    generalized multiple depot traveling salesmen
    0 references
    routing
    0 references
    branch-and-cut
    0 references
    polyhedral study
    0 references
    0 references
    0 references
    0 references

    Identifiers

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