An Asymptotically Optimal Algorithm for the One-Dimensional Convex Hull Feasibility Problem.

Gang Qiao Ambuj Tewari

Published in: CoRR (2023)

Keyphrases

convex hull
asymptotically optimal
learning algorithm
simple polygon
dynamic programming
objective function
np hard
extreme points
similarity measure
worst case
data sets
data points
supply chain
simulated annealing
mixed integer