A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean and Precedence Constrained TSPs.
Mithun GouthamMeghna MenonSarah GarrowStephanie StockarPublished in: CoRR (2023)
Keyphrases
- convex hull
- feasible solution
- traveling salesman problem
- mixed integer
- convex polyhedra
- combinatorial optimization
- point sets
- convex sets
- search algorithm
- simple polygon
- tabu search
- computational geometry
- euclidean space
- optimal solution
- linear inequalities
- recursive algorithm
- lagrangian relaxation
- minimum distance
- euclidean distance
- training samples
- simulated annealing
- active learning
- image processing
- integer points
- finite set of points