A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Sai Yadlapalli / rank
 
Normal rank
Property / author
 
Property / author: Meir Pachter / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: YALMIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.nonrwa.2008.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138388627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on the Multiple Traveling Salesmen Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesperson Problems for the Dubins Vehicle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents / rank
 
Normal rank

Latest revision as of 17:49, 1 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
scientific article

    Statements

    A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2009
    0 references
    unmanned vehicles
    0 references
    combinatorial optimization
    0 references
    Lagrangian relaxation
    0 references
    traveling salesman problem (TSP)
    0 references
    motion planning
    0 references
    Dubins' vehicles
    0 references
    dynamic programming
    0 references

    Identifiers