A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets.
Allen George PhilipZhongqiang RenSivakumar RathinamHowie ChosetPublished in: CoRR (2024)
Keyphrases
- traveling salesman problem
- mixed integer
- moving target
- convex sets
- convex hull
- valid inequalities
- ant colony optimization
- combinatorial optimization
- feasible solution
- lot sizing
- linear program
- optimization problems
- optimal solution
- finite number
- convex optimization
- vehicle routing problem
- linear programming
- continuous variables
- data points
- feature extraction
- computer vision