A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem

DOI10.1007/978-3-540-74356-9_23zbMath1192.90185MaRDI QIDQ3564143

W. A. Malik, Siva Rathinam, Sai Yadlapalli, Swaroop Darbha

Publication date: 2 June 2010

Published in: Advances in Cooperative Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74356-9_23

zbMATH Keywords

NP-hard; motion constraint

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Multi-depot multiple TSP: a polyhedral study and computational results, Dubins traveling salesman problem with neighborhoods: a graph-based approach

Uses Software

• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• The traveling salesman problem and its variations
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Technical Note—A Note on the Multiple Traveling Salesmen Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Traveling Salesperson Problems for the Dubins Vehicle
• The constrained minimum spanning tree problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II