Login / Signup
Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio.
Mikhail Yu. Khachay
Katherine Neznakhina
Ksenia Rizhenko
Published in:
OPTIMA (2022)
Keyphrases
</>
prize collecting
polynomial time approximation
np hard
error bounds
branch and bound algorithm
approximation algorithms
travel time
standard deviation
branch and bound
bin packing
image sequences
evolutionary algorithm
scheduling problem
worst case
theoretical analysis