Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem.
Tommaso AdamoGianpaolo GhianiPier Paolo GrecoEmanuela GuerrieroPublished in: IEEE Access (2023)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- worst case
- branch and bound
- branch and bound algorithm
- upper bounding
- travel time
- tight bounds
- quadratic assignment problem
- sample complexity
- efficiently computable
- error probability
- generalization error
- learning phase
- neural network
- feasible solution
- np hard
- tight upper and lower bounds