The interval min–max regret knapsack packing-delivery problem
Sign Up to like & getrecommendations! Published in 2020 at "International Journal of Production Research"
DOI: 10.1080/00207543.2020.1789235
Abstract: ABSTRACT This paper studies an interval data min–max regret (IDMR) version of the packing-delivery problem, in which a 0-1 knapsack problem is for parcel packing and a capacitated travelling salesman problem is for parcel delivery.… read more here.
Keywords: min max; delivery problem; delivery; packing delivery ... See more keywords