A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (Q3564143): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-540-74356-9_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107575633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4420427 / 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: The traveling salesman problem and its variations / 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: The Traveling-Salesman Problem and Minimum Spanning Trees / 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: On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents / 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: Q4471353 / 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: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesperson Problems for the Dubins Vehicle / rank
 
Normal rank

Latest revision as of 20:51, 2 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem
scientific article

    Statements

    A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 2010
    0 references
    motion constraint
    0 references
    NP-hard
    0 references

    Identifiers