Multi-depot multiple TSP: a polyhedral study and computational results (Q367624): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-011-1024-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119235896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified exact method for solving different classes of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming formulations of multiple salesman problems and its variations / 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: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for minimum perfect 2-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of multidepot multisalesmen problem to the standard travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the plant-cycle location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian path and symmetric travelling salesman polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem / rank
 
Normal rank

Latest revision as of 21:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Multi-depot multiple TSP: a polyhedral study and computational results
scientific article

    Statements

    Multi-depot multiple TSP: a polyhedral study and computational results (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    multiple depot traveling salesman problem
    0 references
    polyhedral study
    0 references
    Branch-and-Cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references