1 paper
Nguyen Thach, Aida Riahifar, Nathan Huynh +1
Solving NP-hard combinatorial optimization problems (COPs) (e.g., traveling salesman problems (TSPs) and capacitated vehicle routing problems (CVRPs)) in practice traditionally inv…