Solving NP-hard Min-max Routing Problems as Sequential Generation with Equity Context

Open in new window